./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/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-?-e2fb8be-m [2025-03-08 17:40:32,626 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:40:32,676 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:40:32,683 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:40:32,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:40:32,702 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:40:32,703 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:40:32,703 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:40:32,703 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:40:32,704 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:40:32,704 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:40:32,704 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:40:32,705 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:40:32,705 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:40:32,705 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:40:32,705 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:40:32,705 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:40:32,705 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:40:32,705 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:40:32,705 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:40:32,705 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:40:32,705 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:40:32,705 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:40:32,705 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:40:32,706 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:40:32,706 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:40:32,706 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:40:32,706 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:40:32,706 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:40:32,706 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:40:32,706 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:40:32,706 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:40:32,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:40:32,706 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:40:32,706 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:40:32,706 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:40:32,706 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:40:32,706 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:40:32,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:40:32,706 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:40:32,706 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:40:32,706 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:40:32,707 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:40:32,707 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-08 17:40:32,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:40:32,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:40:32,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:40:32,932 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:40:32,933 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:40:32,934 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-08 17:40:34,072 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab7ebfd7c/92bb6d549bca4717b610f257a24ab498/FLAG8a07cd61f [2025-03-08 17:40:34,481 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:40:34,483 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i [2025-03-08 17:40:34,522 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab7ebfd7c/92bb6d549bca4717b610f257a24ab498/FLAG8a07cd61f [2025-03-08 17:40:34,636 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab7ebfd7c/92bb6d549bca4717b610f257a24ab498 [2025-03-08 17:40:34,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:40:34,639 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:40:34,640 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:40:34,640 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:40:34,643 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:40:34,643 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:40:34" (1/1) ... [2025-03-08 17:40:34,645 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@223ce780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:34, skipping insertion in model container [2025-03-08 17:40:34,645 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:40:34" (1/1) ... [2025-03-08 17:40:34,705 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:40:36,429 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-08 17:40:36,431 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-08 17:40:36,460 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-08 17:40:36,461 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-08 17:40:36,461 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-08 17:40:36,462 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-08 17:40:36,462 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-08 17:40:36,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:40:36,468 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:40:36,533 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4308] [2025-03-08 17:40:36,534 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4310] [2025-03-08 17:40:36,534 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4315] [2025-03-08 17:40:36,535 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4317] [2025-03-08 17:40:36,535 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4323] [2025-03-08 17:40:36,536 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4325] [2025-03-08 17:40:36,536 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4331] [2025-03-08 17:40:36,536 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4333] [2025-03-08 17:40:36,536 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4339] [2025-03-08 17:40:36,536 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4341] [2025-03-08 17:40:36,537 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4347] [2025-03-08 17:40:36,537 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4349] [2025-03-08 17:40:36,537 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4355] [2025-03-08 17:40:36,537 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4357] [2025-03-08 17:40:36,537 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4363] [2025-03-08 17:40:36,542 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4365] [2025-03-08 17:40:36,542 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4370] [2025-03-08 17:40:36,542 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4372] [2025-03-08 17:40:36,542 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4377] [2025-03-08 17:40:36,542 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4379] [2025-03-08 17:40:36,542 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4384] [2025-03-08 17:40:36,543 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4386] [2025-03-08 17:40:36,543 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4391] [2025-03-08 17:40:36,543 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4393] [2025-03-08 17:40:36,543 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4398] [2025-03-08 17:40:36,544 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4400] [2025-03-08 17:40:36,544 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4405] [2025-03-08 17:40:36,544 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4408] [2025-03-08 17:40:36,544 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4414] [2025-03-08 17:40:36,544 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4417] [2025-03-08 17:40:36,546 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4423] [2025-03-08 17:40:36,546 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4426] [2025-03-08 17:40:36,546 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4432] [2025-03-08 17:40:36,547 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4435] [2025-03-08 17:40:36,547 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4441] [2025-03-08 17:40:36,547 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4444] [2025-03-08 17:40:36,547 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4450] [2025-03-08 17:40:36,548 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4453] [2025-03-08 17:40:36,548 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4460] [2025-03-08 17:40:36,549 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4463] [2025-03-08 17:40:36,549 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4470] [2025-03-08 17:40:36,549 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4473] [2025-03-08 17:40:36,550 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4480] [2025-03-08 17:40:36,550 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4483] [2025-03-08 17:40:36,551 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4490] [2025-03-08 17:40:36,551 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4493] [2025-03-08 17:40:36,552 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4500] [2025-03-08 17:40:36,552 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4503] [2025-03-08 17:40:36,554 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4510] [2025-03-08 17:40:36,554 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4513] [2025-03-08 17:40:36,554 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4519] [2025-03-08 17:40:36,554 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4522] [2025-03-08 17:40:36,555 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4528] [2025-03-08 17:40:36,555 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4531] [2025-03-08 17:40:36,555 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4537] [2025-03-08 17:40:36,555 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4540] [2025-03-08 17:40:36,556 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4546] [2025-03-08 17:40:36,557 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4549] [2025-03-08 17:40:36,557 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4555] [2025-03-08 17:40:36,557 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4558] [2025-03-08 17:40:36,558 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4564] [2025-03-08 17:40:36,558 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4567] [2025-03-08 17:40:36,558 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4573] [2025-03-08 17:40:36,558 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4576] [2025-03-08 17:40:36,559 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4582] [2025-03-08 17:40:36,560 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4585] [2025-03-08 17:40:36,560 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4591] [2025-03-08 17:40:36,560 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4594] [2025-03-08 17:40:36,561 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4600] [2025-03-08 17:40:36,562 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4603] [2025-03-08 17:40:36,562 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4609] [2025-03-08 17:40:36,562 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4612] [2025-03-08 17:40:36,562 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4618] [2025-03-08 17:40:36,563 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4621] [2025-03-08 17:40:36,563 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4627] [2025-03-08 17:40:36,564 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4630] [2025-03-08 17:40:36,564 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4636] [2025-03-08 17:40:36,565 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4639] [2025-03-08 17:40:36,565 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4645] [2025-03-08 17:40:36,565 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4648] [2025-03-08 17:40:36,566 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4654] [2025-03-08 17:40:36,566 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4656] [2025-03-08 17:40:36,566 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4662] [2025-03-08 17:40:36,567 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4664] [2025-03-08 17:40:36,567 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4670] [2025-03-08 17:40:36,568 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4672] [2025-03-08 17:40:36,568 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4678] [2025-03-08 17:40:36,569 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4680] [2025-03-08 17:40:36,569 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4686] [2025-03-08 17:40:36,570 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4688] [2025-03-08 17:40:36,570 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4694] [2025-03-08 17:40:36,570 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4696] [2025-03-08 17:40:36,570 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4702] [2025-03-08 17:40:36,571 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4704] [2025-03-08 17:40:36,571 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4710] [2025-03-08 17:40:36,571 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4712] [2025-03-08 17:40:36,571 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4718] [2025-03-08 17:40:36,572 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4720] [2025-03-08 17:40:36,572 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4726] [2025-03-08 17:40:36,573 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4728] [2025-03-08 17:40:36,608 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-08 17:40:36,609 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-08 17:40:36,616 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-08 17:40:36,616 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-08 17:40:36,617 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-08 17:40:36,617 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-08 17:40:36,618 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-08 17:40:36,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:40:36,806 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:40:36,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:36 WrapperNode [2025-03-08 17:40:36,807 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:40:36,808 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:40:36,808 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:40:36,808 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:40:36,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:36" (1/1) ... [2025-03-08 17:40:36,854 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:36" (1/1) ... [2025-03-08 17:40:36,903 INFO L138 Inliner]: procedures = 914, calls = 950, calls flagged for inlining = 815, calls inlined = 57, statements flattened = 628 [2025-03-08 17:40:36,903 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:40:36,904 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:40:36,904 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:40:36,904 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:40:36,909 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:36" (1/1) ... [2025-03-08 17:40:36,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:36" (1/1) ... [2025-03-08 17:40:36,913 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:36" (1/1) ... [2025-03-08 17:40:36,941 INFO L175 MemorySlicer]: Split 65 memory accesses to 5 slices as follows [2, 9, 8, 44, 2]. 68 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 4, 6, 0]. The 20 writes are split as follows [0, 2, 3, 14, 1]. [2025-03-08 17:40:36,941 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:36" (1/1) ... [2025-03-08 17:40:36,941 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:36" (1/1) ... [2025-03-08 17:40:36,962 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:36" (1/1) ... [2025-03-08 17:40:36,967 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:36" (1/1) ... [2025-03-08 17:40:36,969 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:36" (1/1) ... [2025-03-08 17:40:36,974 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:36" (1/1) ... [2025-03-08 17:40:36,981 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:40:36,983 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:40:36,983 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:40:36,983 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:40:36,984 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:36" (1/1) ... [2025-03-08 17:40:36,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:40:36,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:40:37,011 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-08 17:40:37,014 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-08 17:40:37,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 17:40:37,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 17:40:37,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 17:40:37,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 17:40:37,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 17:40:37,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:40:37,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 17:40:37,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 17:40:37,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 17:40:37,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 17:40:37,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-08 17:40:37,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:40:37,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:40:37,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 17:40:37,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 17:40:37,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 17:40:37,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 17:40:37,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 17:40:37,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-08 17:40:37,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 17:40:37,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 17:40:37,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 17:40:37,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 17:40:37,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 17:40:37,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 17:40:37,032 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2025-03-08 17:40:37,032 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2025-03-08 17:40:37,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 17:40:37,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 17:40:37,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 17:40:37,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-08 17:40:37,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-08 17:40:37,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:40:37,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 17:40:37,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 17:40:37,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 17:40:37,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 17:40:37,035 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 17:40:37,178 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:40:37,179 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:40:37,751 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483: havoc vatomic32_cmpxchg_rel_#t~ret123#1; [2025-03-08 17:40:37,751 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483-9: havoc vatomic32_cmpxchg_rel_#t~ret123#1; [2025-03-08 17:40:37,751 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483-18: havoc vatomic32_cmpxchg_rel_#t~ret123#1; [2025-03-08 17:40:37,751 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6036-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-03-08 17:40:37,751 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6036: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-03-08 17:40:37,752 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438: havoc vatomic32_read_rlx_#t~ret116#1; [2025-03-08 17:40:37,752 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438-9: havoc vatomic32_read_rlx_#t~ret116#1; [2025-03-08 17:40:37,752 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6043: havoc main_~#r~0#1.base, main_~#r~0#1.offset; [2025-03-08 17:40:37,752 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6043-1: SUMMARY for call ULTIMATE.dealloc(main_~#r~0#1.base, main_~#r~0#1.offset); srcloc: null [2025-03-08 17:40:37,752 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443: havoc vatomic32_read_acq_#t~ret117#1; [2025-03-08 17:40:37,752 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-9: havoc vatomic32_read_acq_#t~ret117#1; [2025-03-08 17:40:37,752 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-18: havoc vatomic32_read_acq_#t~ret117#1; [2025-03-08 17:40:37,752 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-27: havoc vatomic32_read_acq_#t~ret117#1; [2025-03-08 17:40:37,752 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2808: havoc vatomic32_await_eq_rlx_#t~ret172#1; [2025-03-08 17:40:37,867 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483: havoc vatomic32_cmpxchg_rel_#t~ret123#1; [2025-03-08 17:40:37,867 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443: havoc vatomic32_read_acq_#t~ret117#1; [2025-03-08 17:40:37,868 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6019: havoc ~#xbo~0#1.base, ~#xbo~0#1.offset; [2025-03-08 17:40:37,868 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6019-1: SUMMARY for call ULTIMATE.dealloc(~#xbo~0#1.base, ~#xbo~0#1.offset); srcloc: null [2025-03-08 17:40:37,868 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438: havoc vatomic32_read_rlx_#t~ret116#1; [2025-03-08 17:40:37,868 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 17:40:37,868 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:40:38,152 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:40:38,155 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:40:38,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:40:38 BoogieIcfgContainer [2025-03-08 17:40:38,156 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:40:38,157 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:40:38,157 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:40:38,160 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:40:38,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:40:34" (1/3) ... [2025-03-08 17:40:38,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f4a635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:40:38, skipping insertion in model container [2025-03-08 17:40:38,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:36" (2/3) ... [2025-03-08 17:40:38,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f4a635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:40:38, skipping insertion in model container [2025-03-08 17:40:38,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:40:38" (3/3) ... [2025-03-08 17:40:38,162 INFO L128 eAbstractionObserver]: Analyzing ICFG bounded_mpmc_check_full.i [2025-03-08 17:40:38,173 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:40:38,175 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-08 17:40:38,175 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 17:40:38,246 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-08 17:40:38,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 172 transitions, 351 flow [2025-03-08 17:40:38,339 INFO L124 PetriNetUnfolderBase]: 96/294 cut-off events. [2025-03-08 17:40:38,343 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 17:40:38,347 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-08 17:40:38,348 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 172 transitions, 351 flow [2025-03-08 17:40:38,354 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 172 transitions, 351 flow [2025-03-08 17:40:38,360 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:40:38,373 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;@728f2fe5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:40:38,373 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-08 17:40:38,378 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:40:38,379 INFO L124 PetriNetUnfolderBase]: 3/7 cut-off events. [2025-03-08 17:40:38,379 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 17:40:38,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:40:38,379 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-08 17:40:38,380 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-08 17:40:38,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:40:38,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1743798, now seen corresponding path program 1 times [2025-03-08 17:40:38,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:40:38,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101000871] [2025-03-08 17:40:38,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:40:38,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:40:38,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-08 17:40:38,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-08 17:40:38,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:40:38,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:40:38,559 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-08 17:40:38,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:40:38,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101000871] [2025-03-08 17:40:38,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101000871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:40:38,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:40:38,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:40:38,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511208467] [2025-03-08 17:40:38,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:40:38,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:40:38,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:40:38,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:40:38,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:40:38,592 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 172 [2025-03-08 17:40:38,595 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-08 17:40:38,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:40:38,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 172 [2025-03-08 17:40:38,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:40:39,149 INFO L124 PetriNetUnfolderBase]: 1229/2613 cut-off events. [2025-03-08 17:40:39,150 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 17:40:39,153 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-08 17:40:39,162 INFO L140 encePairwiseOnDemand]: 129/172 looper letters, 91 selfloop transitions, 2 changer transitions 5/129 dead transitions. [2025-03-08 17:40:39,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 129 transitions, 455 flow [2025-03-08 17:40:39,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:40:39,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:40:39,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 241 transitions. [2025-03-08 17:40:39,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46705426356589147 [2025-03-08 17:40:39,172 INFO L175 Difference]: Start difference. First operand has 121 places, 172 transitions, 351 flow. Second operand 3 states and 241 transitions. [2025-03-08 17:40:39,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 129 transitions, 455 flow [2025-03-08 17:40:39,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 129 transitions, 455 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 17:40:39,180 INFO L231 Difference]: Finished difference. Result has 121 places, 124 transitions, 259 flow [2025-03-08 17:40:39,181 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-08 17:40:39,184 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, 0 predicate places. [2025-03-08 17:40:39,185 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 124 transitions, 259 flow [2025-03-08 17:40:39,185 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-08 17:40:39,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:40:39,185 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 17:40:39,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:40:39,186 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-08 17:40:39,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:40:39,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1675962557, now seen corresponding path program 1 times [2025-03-08 17:40:39,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:40:39,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13724764] [2025-03-08 17:40:39,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:40:39,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:40:39,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 17:40:39,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 17:40:39,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:40:39,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:40:39,296 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-08 17:40:39,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:40:39,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13724764] [2025-03-08 17:40:39,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13724764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:40:39,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:40:39,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:40:39,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676982684] [2025-03-08 17:40:39,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:40:39,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:40:39,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:40:39,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:40:39,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:40:39,309 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 172 [2025-03-08 17:40:39,309 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-08 17:40:39,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:40:39,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 172 [2025-03-08 17:40:39,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:40:39,686 INFO L124 PetriNetUnfolderBase]: 1189/2481 cut-off events. [2025-03-08 17:40:39,687 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 17:40:39,690 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-08 17:40:39,698 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 91 selfloop transitions, 2 changer transitions 0/122 dead transitions. [2025-03-08 17:40:39,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 122 transitions, 441 flow [2025-03-08 17:40:39,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:40:39,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:40:39,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 199 transitions. [2025-03-08 17:40:39,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3856589147286822 [2025-03-08 17:40:39,702 INFO L175 Difference]: Start difference. First operand has 121 places, 124 transitions, 259 flow. Second operand 3 states and 199 transitions. [2025-03-08 17:40:39,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 122 transitions, 441 flow [2025-03-08 17:40:39,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 122 transitions, 437 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 17:40:39,704 INFO L231 Difference]: Finished difference. Result has 114 places, 122 transitions, 255 flow [2025-03-08 17:40:39,704 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-08 17:40:39,704 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, -7 predicate places. [2025-03-08 17:40:39,704 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 122 transitions, 255 flow [2025-03-08 17:40:39,704 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-08 17:40:39,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:40:39,705 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-08 17:40:39,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:40:39,705 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-08 17:40:39,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:40:39,705 INFO L85 PathProgramCache]: Analyzing trace with hash -98404303, now seen corresponding path program 1 times [2025-03-08 17:40:39,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:40:39,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137487758] [2025-03-08 17:40:39,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:40:39,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:40:39,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 17:40:39,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 17:40:39,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:40:39,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:40:39,794 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 17:40:39,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 17:40:39,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 17:40:39,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:40:39,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:40:39,874 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 17:40:39,874 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 17:40:39,875 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-03-08 17:40:39,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2025-03-08 17:40:39,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2025-03-08 17:40:39,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-03-08 17:40:39,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-03-08 17:40:39,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-03-08 17:40:39,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2025-03-08 17:40:39,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2025-03-08 17:40:39,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:40:39,877 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 17:40:39,879 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 17:40:39,879 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-08 17:40:39,959 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-08 17:40:39,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 195 transitions, 406 flow [2025-03-08 17:40:39,993 INFO L124 PetriNetUnfolderBase]: 187/564 cut-off events. [2025-03-08 17:40:39,994 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-08 17:40:39,996 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-08 17:40:39,997 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 195 transitions, 406 flow [2025-03-08 17:40:39,999 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 195 transitions, 406 flow [2025-03-08 17:40:40,000 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:40:40,002 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;@728f2fe5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:40:40,002 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-08 17:40:40,004 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:40:40,004 INFO L124 PetriNetUnfolderBase]: 3/7 cut-off events. [2025-03-08 17:40:40,004 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 17:40:40,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:40:40,004 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-08 17:40:40,004 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-08 17:40:40,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:40:40,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1937433, now seen corresponding path program 1 times [2025-03-08 17:40:40,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:40:40,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247882954] [2025-03-08 17:40:40,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:40:40,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:40:40,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-08 17:40:40,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-08 17:40:40,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:40:40,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:40:40,046 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-08 17:40:40,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:40:40,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247882954] [2025-03-08 17:40:40,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247882954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:40:40,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:40:40,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:40:40,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209968112] [2025-03-08 17:40:40,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:40:40,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:40:40,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:40:40,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:40:40,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:40:40,052 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 195 [2025-03-08 17:40:40,052 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-08 17:40:40,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:40:40,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 195 [2025-03-08 17:40:40,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:40:45,008 INFO L124 PetriNetUnfolderBase]: 41903/65173 cut-off events. [2025-03-08 17:40:45,008 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2025-03-08 17:40:45,071 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-08 17:40:45,253 INFO L140 encePairwiseOnDemand]: 151/195 looper letters, 113 selfloop transitions, 2 changer transitions 5/151 dead transitions. [2025-03-08 17:40:45,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 151 transitions, 552 flow [2025-03-08 17:40:45,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:40:45,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:40:45,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 264 transitions. [2025-03-08 17:40:45,255 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4512820512820513 [2025-03-08 17:40:45,255 INFO L175 Difference]: Start difference. First operand has 140 places, 195 transitions, 406 flow. Second operand 3 states and 264 transitions. [2025-03-08 17:40:45,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 151 transitions, 552 flow [2025-03-08 17:40:45,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 151 transitions, 552 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 17:40:45,259 INFO L231 Difference]: Finished difference. Result has 140 places, 146 transitions, 312 flow [2025-03-08 17:40:45,259 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-08 17:40:45,260 INFO L279 CegarLoopForPetriNet]: 140 programPoint places, 0 predicate places. [2025-03-08 17:40:45,260 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 146 transitions, 312 flow [2025-03-08 17:40:45,260 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-08 17:40:45,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:40:45,260 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 17:40:45,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:40:45,260 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-08 17:40:45,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:40:45,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1862052032, now seen corresponding path program 1 times [2025-03-08 17:40:45,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:40:45,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807226963] [2025-03-08 17:40:45,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:40:45,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:40:45,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 17:40:45,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 17:40:45,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:40:45,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:40:45,332 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-08 17:40:45,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:40:45,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807226963] [2025-03-08 17:40:45,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807226963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:40:45,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:40:45,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:40:45,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324044071] [2025-03-08 17:40:45,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:40:45,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:40:45,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:40:45,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:40:45,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:40:45,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 195 [2025-03-08 17:40:45,336 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-08 17:40:45,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:40:45,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 195 [2025-03-08 17:40:45,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:40:49,434 INFO L124 PetriNetUnfolderBase]: 40463/62111 cut-off events. [2025-03-08 17:40:49,434 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2025-03-08 17:40:49,514 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-08 17:40:49,700 INFO L140 encePairwiseOnDemand]: 192/195 looper letters, 113 selfloop transitions, 2 changer transitions 0/144 dead transitions. [2025-03-08 17:40:49,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 144 transitions, 538 flow [2025-03-08 17:40:49,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:40:49,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:40:49,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2025-03-08 17:40:49,703 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37777777777777777 [2025-03-08 17:40:49,703 INFO L175 Difference]: Start difference. First operand has 140 places, 146 transitions, 312 flow. Second operand 3 states and 221 transitions. [2025-03-08 17:40:49,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 144 transitions, 538 flow [2025-03-08 17:40:49,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 144 transitions, 534 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 17:40:49,709 INFO L231 Difference]: Finished difference. Result has 133 places, 144 transitions, 308 flow [2025-03-08 17:40:49,709 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-08 17:40:49,711 INFO L279 CegarLoopForPetriNet]: 140 programPoint places, -7 predicate places. [2025-03-08 17:40:49,711 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 144 transitions, 308 flow [2025-03-08 17:40:49,711 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-08 17:40:49,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:40:49,712 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-08 17:40:49,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 17:40:49,712 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-08 17:40:49,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:40:49,712 INFO L85 PathProgramCache]: Analyzing trace with hash 713688723, now seen corresponding path program 1 times [2025-03-08 17:40:49,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:40:49,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624937233] [2025-03-08 17:40:49,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:40:49,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:40:49,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 17:40:49,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 17:40:49,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:40:49,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:40:49,903 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-08 17:40:49,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:40:49,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624937233] [2025-03-08 17:40:49,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624937233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:40:49,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:40:49,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:40:49,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841736990] [2025-03-08 17:40:49,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:40:49,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:40:49,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:40:49,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:40:49,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:40:49,905 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 195 [2025-03-08 17:40:49,905 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-08 17:40:49,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:40:49,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 195 [2025-03-08 17:40:49,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:40:53,958 INFO L124 PetriNetUnfolderBase]: 39765/64420 cut-off events. [2025-03-08 17:40:53,958 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2025-03-08 17:40:54,022 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-08 17:40:54,184 INFO L140 encePairwiseOnDemand]: 191/195 looper letters, 213 selfloop transitions, 4 changer transitions 0/245 dead transitions. [2025-03-08 17:40:54,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 245 transitions, 942 flow [2025-03-08 17:40:54,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:40:54,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:40:54,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 400 transitions. [2025-03-08 17:40:54,185 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41025641025641024 [2025-03-08 17:40:54,185 INFO L175 Difference]: Start difference. First operand has 133 places, 144 transitions, 308 flow. Second operand 5 states and 400 transitions. [2025-03-08 17:40:54,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 245 transitions, 942 flow [2025-03-08 17:40:54,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 245 transitions, 934 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-08 17:40:54,192 INFO L231 Difference]: Finished difference. Result has 133 places, 144 transitions, 310 flow [2025-03-08 17:40:54,193 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-08 17:40:54,193 INFO L279 CegarLoopForPetriNet]: 140 programPoint places, -7 predicate places. [2025-03-08 17:40:54,193 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 144 transitions, 310 flow [2025-03-08 17:40:54,193 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-08 17:40:54,193 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:40:54,194 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-08 17:40:54,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 17:40:54,194 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-08 17:40:54,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:40:54,194 INFO L85 PathProgramCache]: Analyzing trace with hash -620097678, now seen corresponding path program 1 times [2025-03-08 17:40:54,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:40:54,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454818083] [2025-03-08 17:40:54,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:40:54,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:40:54,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 17:40:54,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 17:40:54,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:40:54,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:40:54,330 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-08 17:40:54,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:40:54,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454818083] [2025-03-08 17:40:54,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454818083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:40:54,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:40:54,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:40:54,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341137617] [2025-03-08 17:40:54,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:40:54,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:40:54,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:40:54,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:40:54,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:40:54,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 195 [2025-03-08 17:40:54,333 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-08 17:40:54,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:40:54,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 195 [2025-03-08 17:40:54,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:40:55,206 INFO L124 PetriNetUnfolderBase]: 4813/8660 cut-off events. [2025-03-08 17:40:55,206 INFO L125 PetriNetUnfolderBase]: For 1207/1207 co-relation queries the response was YES. [2025-03-08 17:40:55,215 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-08 17:40:55,235 INFO L140 encePairwiseOnDemand]: 192/195 looper letters, 158 selfloop transitions, 2 changer transitions 0/188 dead transitions. [2025-03-08 17:40:55,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 188 transitions, 722 flow [2025-03-08 17:40:55,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:40:55,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:40:55,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 268 transitions. [2025-03-08 17:40:55,236 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4581196581196581 [2025-03-08 17:40:55,236 INFO L175 Difference]: Start difference. First operand has 133 places, 144 transitions, 310 flow. Second operand 3 states and 268 transitions. [2025-03-08 17:40:55,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 188 transitions, 722 flow [2025-03-08 17:40:55,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 188 transitions, 720 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:40:55,241 INFO L231 Difference]: Finished difference. Result has 135 places, 145 transitions, 320 flow [2025-03-08 17:40:55,241 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-08 17:40:55,244 INFO L279 CegarLoopForPetriNet]: 140 programPoint places, -5 predicate places. [2025-03-08 17:40:55,245 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 145 transitions, 320 flow [2025-03-08 17:40:55,246 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-08 17:40:55,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:40:55,246 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-08 17:40:55,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 17:40:55,246 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-08 17:40:55,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:40:55,247 INFO L85 PathProgramCache]: Analyzing trace with hash 37787147, now seen corresponding path program 1 times [2025-03-08 17:40:55,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:40:55,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981628066] [2025-03-08 17:40:55,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:40:55,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:40:55,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 17:40:55,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 17:40:55,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:40:55,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:40:55,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:40:55,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:40:55,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981628066] [2025-03-08 17:40:55,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981628066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:40:55,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:40:55,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:40:55,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521214670] [2025-03-08 17:40:55,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:40:55,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:40:55,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:40:55,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:40:55,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:40:55,375 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 195 [2025-03-08 17:40:55,375 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-08 17:40:55,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:40:55,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 195 [2025-03-08 17:40:55,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:40:56,796 INFO L124 PetriNetUnfolderBase]: 8074/13715 cut-off events. [2025-03-08 17:40:56,796 INFO L125 PetriNetUnfolderBase]: For 5089/5089 co-relation queries the response was YES. [2025-03-08 17:40:56,811 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-08 17:40:56,849 INFO L140 encePairwiseOnDemand]: 192/195 looper letters, 217 selfloop transitions, 2 changer transitions 0/247 dead transitions. [2025-03-08 17:40:56,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 247 transitions, 983 flow [2025-03-08 17:40:56,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:40:56,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:40:56,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2025-03-08 17:40:56,850 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-03-08 17:40:56,851 INFO L175 Difference]: Start difference. First operand has 135 places, 145 transitions, 320 flow. Second operand 3 states and 325 transitions. [2025-03-08 17:40:56,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 247 transitions, 983 flow [2025-03-08 17:40:56,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 247 transitions, 979 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:40:56,856 INFO L231 Difference]: Finished difference. Result has 137 places, 146 transitions, 330 flow [2025-03-08 17:40:56,856 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-08 17:40:56,857 INFO L279 CegarLoopForPetriNet]: 140 programPoint places, -3 predicate places. [2025-03-08 17:40:56,857 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 146 transitions, 330 flow [2025-03-08 17:40:56,857 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-08 17:40:56,857 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:40:56,857 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-08 17:40:56,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 17:40:56,858 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-08 17:40:56,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:40:56,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1584303282, now seen corresponding path program 1 times [2025-03-08 17:40:56,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:40:56,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513357432] [2025-03-08 17:40:56,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:40:56,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:40:56,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 17:40:56,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 17:40:56,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:40:56,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:40:56,963 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-08 17:40:56,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:40:56,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513357432] [2025-03-08 17:40:56,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513357432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:40:56,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:40:56,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:40:56,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031428822] [2025-03-08 17:40:56,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:40:56,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:40:56,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:40:56,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:40:56,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:40:56,964 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 195 [2025-03-08 17:40:56,964 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-08 17:40:56,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:40:56,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 195 [2025-03-08 17:40:56,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:40:58,608 INFO L124 PetriNetUnfolderBase]: 13216/21938 cut-off events. [2025-03-08 17:40:58,608 INFO L125 PetriNetUnfolderBase]: For 7418/7418 co-relation queries the response was YES. [2025-03-08 17:40:58,636 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-08 17:40:58,683 INFO L140 encePairwiseOnDemand]: 192/195 looper letters, 216 selfloop transitions, 2 changer transitions 0/246 dead transitions. [2025-03-08 17:40:58,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 246 transitions, 990 flow [2025-03-08 17:40:58,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:40:58,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:40:58,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2025-03-08 17:40:58,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5521367521367522 [2025-03-08 17:40:58,685 INFO L175 Difference]: Start difference. First operand has 137 places, 146 transitions, 330 flow. Second operand 3 states and 323 transitions. [2025-03-08 17:40:58,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 246 transitions, 990 flow [2025-03-08 17:40:58,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 246 transitions, 986 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:40:58,690 INFO L231 Difference]: Finished difference. Result has 139 places, 147 transitions, 340 flow [2025-03-08 17:40:58,691 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-08 17:40:58,691 INFO L279 CegarLoopForPetriNet]: 140 programPoint places, -1 predicate places. [2025-03-08 17:40:58,691 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 147 transitions, 340 flow [2025-03-08 17:40:58,691 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-08 17:40:58,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:40:58,692 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-08 17:40:58,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 17:40:58,692 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-08 17:40:58,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:40:58,692 INFO L85 PathProgramCache]: Analyzing trace with hash 656123225, now seen corresponding path program 1 times [2025-03-08 17:40:58,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:40:58,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577233468] [2025-03-08 17:40:58,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:40:58,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:40:58,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 17:40:58,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 17:40:58,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:40:58,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:40:58,795 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-08 17:40:58,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:40:58,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577233468] [2025-03-08 17:40:58,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577233468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:40:58,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:40:58,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:40:58,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925372699] [2025-03-08 17:40:58,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:40:58,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:40:58,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:40:58,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:40:58,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:40:58,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 195 [2025-03-08 17:40:58,797 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-08 17:40:58,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:40:58,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 195 [2025-03-08 17:40:58,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:41:00,528 INFO L124 PetriNetUnfolderBase]: 15076/25250 cut-off events. [2025-03-08 17:41:00,528 INFO L125 PetriNetUnfolderBase]: For 8893/8893 co-relation queries the response was YES. [2025-03-08 17:41:00,558 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-08 17:41:00,610 INFO L140 encePairwiseOnDemand]: 190/195 looper letters, 288 selfloop transitions, 4 changer transitions 0/320 dead transitions. [2025-03-08 17:41:00,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 320 transitions, 1328 flow [2025-03-08 17:41:00,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:41:00,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:41:00,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 429 transitions. [2025-03-08 17:41:00,611 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-03-08 17:41:00,611 INFO L175 Difference]: Start difference. First operand has 139 places, 147 transitions, 340 flow. Second operand 4 states and 429 transitions. [2025-03-08 17:41:00,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 320 transitions, 1328 flow [2025-03-08 17:41:00,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 320 transitions, 1322 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:41:00,619 INFO L231 Difference]: Finished difference. Result has 143 places, 150 transitions, 366 flow [2025-03-08 17:41:00,619 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-08 17:41:00,619 INFO L279 CegarLoopForPetriNet]: 140 programPoint places, 3 predicate places. [2025-03-08 17:41:00,619 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 150 transitions, 366 flow [2025-03-08 17:41:00,619 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-08 17:41:00,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:41:00,620 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-08 17:41:00,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 17:41:00,620 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-08 17:41:00,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:41:00,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1479017072, now seen corresponding path program 1 times [2025-03-08 17:41:00,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:41:00,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621506309] [2025-03-08 17:41:00,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:41:00,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:41:00,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 17:41:00,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 17:41:00,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:41:00,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:41:00,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:41:00,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:41:00,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621506309] [2025-03-08 17:41:00,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621506309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:41:00,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:41:00,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:41:00,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838010307] [2025-03-08 17:41:00,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:41:00,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:41:00,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:41:00,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:41:00,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:41:00,759 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 195 [2025-03-08 17:41:00,760 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-08 17:41:00,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:41:00,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 195 [2025-03-08 17:41:00,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:41:02,718 INFO L124 PetriNetUnfolderBase]: 17170/28706 cut-off events. [2025-03-08 17:41:02,719 INFO L125 PetriNetUnfolderBase]: For 14227/14227 co-relation queries the response was YES. [2025-03-08 17:41:02,789 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-08 17:41:02,860 INFO L140 encePairwiseOnDemand]: 190/195 looper letters, 291 selfloop transitions, 4 changer transitions 0/323 dead transitions. [2025-03-08 17:41:02,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 323 transitions, 1390 flow [2025-03-08 17:41:02,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:41:02,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:41:02,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 425 transitions. [2025-03-08 17:41:02,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5448717948717948 [2025-03-08 17:41:02,861 INFO L175 Difference]: Start difference. First operand has 143 places, 150 transitions, 366 flow. Second operand 4 states and 425 transitions. [2025-03-08 17:41:02,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 323 transitions, 1390 flow [2025-03-08 17:41:02,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 323 transitions, 1384 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:41:02,884 INFO L231 Difference]: Finished difference. Result has 147 places, 153 transitions, 392 flow [2025-03-08 17:41:02,884 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-08 17:41:02,885 INFO L279 CegarLoopForPetriNet]: 140 programPoint places, 7 predicate places. [2025-03-08 17:41:02,885 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 153 transitions, 392 flow [2025-03-08 17:41:02,885 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-08 17:41:02,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:41:02,885 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-08 17:41:02,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 17:41:02,885 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-08 17:41:02,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:41:02,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1123055270, now seen corresponding path program 1 times [2025-03-08 17:41:02,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:41:02,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391826866] [2025-03-08 17:41:02,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:41:02,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:41:02,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 17:41:02,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 17:41:02,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:41:02,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:41:03,083 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-08 17:41:03,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:41:03,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391826866] [2025-03-08 17:41:03,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391826866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:41:03,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:41:03,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:41:03,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833778581] [2025-03-08 17:41:03,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:41:03,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:41:03,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:41:03,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:41:03,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:41:03,084 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 195 [2025-03-08 17:41:03,084 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-08 17:41:03,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:41:03,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 195 [2025-03-08 17:41:03,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:41:05,505 INFO L124 PetriNetUnfolderBase]: 19282/32198 cut-off events. [2025-03-08 17:41:05,505 INFO L125 PetriNetUnfolderBase]: For 18088/18088 co-relation queries the response was YES. [2025-03-08 17:41:05,554 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-08 17:41:05,622 INFO L140 encePairwiseOnDemand]: 190/195 looper letters, 300 selfloop transitions, 4 changer transitions 0/332 dead transitions. [2025-03-08 17:41:05,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 332 transitions, 1462 flow [2025-03-08 17:41:05,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:41:05,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:41:05,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 429 transitions. [2025-03-08 17:41:05,624 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-03-08 17:41:05,624 INFO L175 Difference]: Start difference. First operand has 147 places, 153 transitions, 392 flow. Second operand 4 states and 429 transitions. [2025-03-08 17:41:05,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 332 transitions, 1462 flow [2025-03-08 17:41:05,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 332 transitions, 1456 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:41:05,700 INFO L231 Difference]: Finished difference. Result has 151 places, 156 transitions, 424 flow [2025-03-08 17:41:05,701 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-08 17:41:05,701 INFO L279 CegarLoopForPetriNet]: 140 programPoint places, 11 predicate places. [2025-03-08 17:41:05,701 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 156 transitions, 424 flow [2025-03-08 17:41:05,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-08 17:41:05,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:41:05,702 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-08 17:41:05,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 17:41:05,702 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-08 17:41:05,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:41:05,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1490628408, now seen corresponding path program 1 times [2025-03-08 17:41:05,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:41:05,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818683462] [2025-03-08 17:41:05,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:41:05,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:41:05,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 17:41:05,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 17:41:05,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:41:05,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:41:05,810 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-08 17:41:05,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:41:05,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818683462] [2025-03-08 17:41:05,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818683462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:41:05,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:41:05,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:41:05,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642732521] [2025-03-08 17:41:05,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:41:05,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:41:05,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:41:05,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:41:05,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:41:05,813 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 195 [2025-03-08 17:41:05,813 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-08 17:41:05,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:41:05,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 195 [2025-03-08 17:41:05,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:41:08,303 INFO L124 PetriNetUnfolderBase]: 21628/36050 cut-off events. [2025-03-08 17:41:08,304 INFO L125 PetriNetUnfolderBase]: For 27944/27944 co-relation queries the response was YES. [2025-03-08 17:41:08,414 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-08 17:41:08,514 INFO L140 encePairwiseOnDemand]: 190/195 looper letters, 303 selfloop transitions, 4 changer transitions 0/335 dead transitions. [2025-03-08 17:41:08,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 335 transitions, 1542 flow [2025-03-08 17:41:08,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:41:08,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:41:08,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 425 transitions. [2025-03-08 17:41:08,515 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5448717948717948 [2025-03-08 17:41:08,515 INFO L175 Difference]: Start difference. First operand has 151 places, 156 transitions, 424 flow. Second operand 4 states and 425 transitions. [2025-03-08 17:41:08,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 335 transitions, 1542 flow [2025-03-08 17:41:08,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 335 transitions, 1518 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-03-08 17:41:08,653 INFO L231 Difference]: Finished difference. Result has 155 places, 159 transitions, 450 flow [2025-03-08 17:41:08,653 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-08 17:41:08,654 INFO L279 CegarLoopForPetriNet]: 140 programPoint places, 15 predicate places. [2025-03-08 17:41:08,654 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 159 transitions, 450 flow [2025-03-08 17:41:08,654 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-08 17:41:08,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:41:08,654 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-08 17:41:08,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 17:41:08,654 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-08 17:41:08,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:41:08,655 INFO L85 PathProgramCache]: Analyzing trace with hash 392491672, now seen corresponding path program 1 times [2025-03-08 17:41:08,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:41:08,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11965349] [2025-03-08 17:41:08,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:41:08,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:41:08,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 17:41:08,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 17:41:08,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:41:08,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:41:08,785 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-08 17:41:08,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:41:08,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11965349] [2025-03-08 17:41:08,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11965349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:41:08,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:41:08,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:41:08,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387933705] [2025-03-08 17:41:08,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:41:08,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:41:08,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:41:08,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:41:08,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:41:08,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 195 [2025-03-08 17:41:08,787 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-08 17:41:08,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:41:08,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 195 [2025-03-08 17:41:08,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:41:12,326 INFO L124 PetriNetUnfolderBase]: 30592/49360 cut-off events. [2025-03-08 17:41:12,326 INFO L125 PetriNetUnfolderBase]: For 43722/43722 co-relation queries the response was YES. [2025-03-08 17:41:12,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137455 conditions, 49360 events. 30592/49360 cut-off events. For 43722/43722 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 320109 event pairs, 10653 based on Foata normal form. 230/47060 useless extension candidates. Maximal degree in co-relation 116751. Up to 20261 conditions per place. [2025-03-08 17:41:12,616 INFO L140 encePairwiseOnDemand]: 192/195 looper letters, 357 selfloop transitions, 3 changer transitions 0/388 dead transitions. [2025-03-08 17:41:12,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 388 transitions, 1860 flow [2025-03-08 17:41:12,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:41:12,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:41:12,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 462 transitions. [2025-03-08 17:41:12,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5923076923076923 [2025-03-08 17:41:12,617 INFO L175 Difference]: Start difference. First operand has 155 places, 159 transitions, 450 flow. Second operand 4 states and 462 transitions. [2025-03-08 17:41:12,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 388 transitions, 1860 flow [2025-03-08 17:41:12,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 388 transitions, 1836 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-03-08 17:41:12,906 INFO L231 Difference]: Finished difference. Result has 158 places, 160 transitions, 458 flow [2025-03-08 17:41:12,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=458, PETRI_PLACES=158, PETRI_TRANSITIONS=160} [2025-03-08 17:41:12,907 INFO L279 CegarLoopForPetriNet]: 140 programPoint places, 18 predicate places. [2025-03-08 17:41:12,907 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 160 transitions, 458 flow [2025-03-08 17:41:12,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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-08 17:41:12,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:41:12,907 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-08 17:41:12,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 17:41:12,907 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-08 17:41:12,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:41:12,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1289202022, now seen corresponding path program 1 times [2025-03-08 17:41:12,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:41:12,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483925457] [2025-03-08 17:41:12,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:41:12,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:41:12,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 17:41:12,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 17:41:12,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:41:12,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:41:13,037 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-08 17:41:13,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:41:13,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483925457] [2025-03-08 17:41:13,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483925457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:41:13,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:41:13,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:41:13,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709591550] [2025-03-08 17:41:13,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:41:13,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:41:13,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:41:13,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:41:13,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:41:13,039 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 195 [2025-03-08 17:41:13,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 160 transitions, 458 flow. Second operand has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 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-08 17:41:13,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:41:13,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 195 [2025-03-08 17:41:13,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:41:18,616 INFO L124 PetriNetUnfolderBase]: 43075/68978 cut-off events. [2025-03-08 17:41:18,616 INFO L125 PetriNetUnfolderBase]: For 58632/58632 co-relation queries the response was YES. [2025-03-08 17:41:18,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191633 conditions, 68978 events. 43075/68978 cut-off events. For 58632/58632 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 452797 event pairs, 14693 based on Foata normal form. 311/65916 useless extension candidates. Maximal degree in co-relation 165846. Up to 28835 conditions per place. [2025-03-08 17:41:18,955 INFO L140 encePairwiseOnDemand]: 192/195 looper letters, 354 selfloop transitions, 3 changer transitions 0/385 dead transitions. [2025-03-08 17:41:18,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 385 transitions, 1856 flow [2025-03-08 17:41:18,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:41:18,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:41:18,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 458 transitions. [2025-03-08 17:41:18,957 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5871794871794872 [2025-03-08 17:41:18,957 INFO L175 Difference]: Start difference. First operand has 158 places, 160 transitions, 458 flow. Second operand 4 states and 458 transitions. [2025-03-08 17:41:18,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 385 transitions, 1856 flow [2025-03-08 17:41:19,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 385 transitions, 1838 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-08 17:41:19,311 INFO L231 Difference]: Finished difference. Result has 160 places, 161 transitions, 468 flow [2025-03-08 17:41:19,312 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=468, PETRI_PLACES=160, PETRI_TRANSITIONS=161} [2025-03-08 17:41:19,312 INFO L279 CegarLoopForPetriNet]: 140 programPoint places, 20 predicate places. [2025-03-08 17:41:19,312 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 161 transitions, 468 flow [2025-03-08 17:41:19,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 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-08 17:41:19,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:41:19,312 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:41:19,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 17:41:19,313 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-08 17:41:19,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:41:19,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1118867541, now seen corresponding path program 2 times [2025-03-08 17:41:19,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:41:19,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591570043] [2025-03-08 17:41:19,313 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:41:19,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:41:19,332 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-03-08 17:41:19,342 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 50 of 65 statements. [2025-03-08 17:41:19,342 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:41:19,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:41:19,421 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 17:41:19,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:41:19,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591570043] [2025-03-08 17:41:19,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591570043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:41:19,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:41:19,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:41:19,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239057064] [2025-03-08 17:41:19,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:41:19,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:41:19,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:41:19,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:41:19,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:41:19,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 195 [2025-03-08 17:41:19,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 161 transitions, 468 flow. Second operand has 4 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 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-08 17:41:19,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:41:19,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 195 [2025-03-08 17:41:19,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:41:23,870 INFO L124 PetriNetUnfolderBase]: 34931/52506 cut-off events. [2025-03-08 17:41:23,870 INFO L125 PetriNetUnfolderBase]: For 62302/62302 co-relation queries the response was YES. [2025-03-08 17:41:23,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154900 conditions, 52506 events. 34931/52506 cut-off events. For 62302/62302 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 319606 event pairs, 12608 based on Foata normal form. 130/51036 useless extension candidates. Maximal degree in co-relation 147977. Up to 27968 conditions per place. [2025-03-08 17:41:24,122 INFO L140 encePairwiseOnDemand]: 192/195 looper letters, 245 selfloop transitions, 3 changer transitions 3/277 dead transitions. [2025-03-08 17:41:24,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 277 transitions, 1438 flow [2025-03-08 17:41:24,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:41:24,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:41:24,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 345 transitions. [2025-03-08 17:41:24,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4423076923076923 [2025-03-08 17:41:24,123 INFO L175 Difference]: Start difference. First operand has 160 places, 161 transitions, 468 flow. Second operand 4 states and 345 transitions. [2025-03-08 17:41:24,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 277 transitions, 1438 flow [2025-03-08 17:41:24,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 277 transitions, 1420 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-08 17:41:24,221 INFO L231 Difference]: Finished difference. Result has 162 places, 159 transitions, 468 flow [2025-03-08 17:41:24,221 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=468, PETRI_PLACES=162, PETRI_TRANSITIONS=159} [2025-03-08 17:41:24,221 INFO L279 CegarLoopForPetriNet]: 140 programPoint places, 22 predicate places. [2025-03-08 17:41:24,221 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 159 transitions, 468 flow [2025-03-08 17:41:24,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 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-08 17:41:24,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:41:24,222 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:41:24,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 17:41:24,222 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-08 17:41:24,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:41:24,222 INFO L85 PathProgramCache]: Analyzing trace with hash 131129585, now seen corresponding path program 1 times [2025-03-08 17:41:24,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:41:24,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883437979] [2025-03-08 17:41:24,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:41:24,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:41:24,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 17:41:24,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 17:41:24,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:41:24,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:41:27,556 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 17:41:27,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:41:27,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883437979] [2025-03-08 17:41:27,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883437979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:41:27,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:41:27,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-08 17:41:27,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102135164] [2025-03-08 17:41:27,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:41:27,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 17:41:27,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:41:27,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 17:41:27,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2025-03-08 17:41:27,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 195 [2025-03-08 17:41:27,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 159 transitions, 468 flow. Second operand has 20 states, 20 states have (on average 40.15) internal successors, (803), 20 states have internal predecessors, (803), 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-08 17:41:27,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:41:27,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 195 [2025-03-08 17:41:27,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:41:33,958 INFO L124 PetriNetUnfolderBase]: 37717/56738 cut-off events. [2025-03-08 17:41:33,958 INFO L125 PetriNetUnfolderBase]: For 68368/68368 co-relation queries the response was YES. [2025-03-08 17:41:34,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170453 conditions, 56738 events. 37717/56738 cut-off events. For 68368/68368 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 332173 event pairs, 11717 based on Foata normal form. 271/55386 useless extension candidates. Maximal degree in co-relation 168620. Up to 52921 conditions per place. [2025-03-08 17:41:34,293 INFO L140 encePairwiseOnDemand]: 174/195 looper letters, 341 selfloop transitions, 50 changer transitions 0/417 dead transitions. [2025-03-08 17:41:34,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 417 transitions, 2229 flow [2025-03-08 17:41:34,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 17:41:34,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-08 17:41:34,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1067 transitions. [2025-03-08 17:41:34,296 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2735897435897436 [2025-03-08 17:41:34,296 INFO L175 Difference]: Start difference. First operand has 162 places, 159 transitions, 468 flow. Second operand 20 states and 1067 transitions. [2025-03-08 17:41:34,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 417 transitions, 2229 flow [2025-03-08 17:41:34,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 417 transitions, 2191 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-08 17:41:34,525 INFO L231 Difference]: Finished difference. Result has 188 places, 210 transitions, 858 flow [2025-03-08 17:41:34,525 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=858, PETRI_PLACES=188, PETRI_TRANSITIONS=210} [2025-03-08 17:41:34,525 INFO L279 CegarLoopForPetriNet]: 140 programPoint places, 48 predicate places. [2025-03-08 17:41:34,526 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 210 transitions, 858 flow [2025-03-08 17:41:34,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 40.15) internal successors, (803), 20 states have internal predecessors, (803), 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-08 17:41:34,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:41:34,527 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:41:34,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 17:41:34,527 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-08 17:41:34,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:41:34,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1370016527, now seen corresponding path program 2 times [2025-03-08 17:41:34,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:41:34,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307251851] [2025-03-08 17:41:34,527 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:41:34,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:41:34,563 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 100 statements into 2 equivalence classes. [2025-03-08 17:41:34,739 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 17:41:34,739 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:41:34,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat