./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! 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-?-551b009-m [2025-01-09 16:50:49,512 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:50:49,564 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:50:49,570 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:50:49,573 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:50:49,594 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:50:49,596 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:50:49,596 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:50:49,597 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:50:49,597 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:50:49,597 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:50:49,597 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:50:49,598 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:50:49,598 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:50:49,598 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:50:49,598 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:50:49,598 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:50:49,598 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:50:49,599 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:50:49,599 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:50:49,599 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:50:49,599 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:50:49,599 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:50:49,599 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:50:49,599 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:50:49,599 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:50:49,600 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:50:49,600 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:50:49,600 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:50:49,600 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:50:49,600 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:50:49,600 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:50:49,600 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:50:49,600 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:50:49,601 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:50:49,601 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:50:49,601 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:50:49,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:50:49,601 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:50:49,601 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:50:49,601 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:50:49,601 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:50:49,601 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:50:49,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:50:49,601 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:50:49,601 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:50:49,601 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:50:49,602 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:50:49,602 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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-01-09 16:50:49,830 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:50:49,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:50:49,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:50:49,837 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:50:49,838 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:50:49,838 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i [2025-01-09 16:50:50,999 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d81b75328/b3820eff83054e5cb70c9456a91dff59/FLAG512918f7c [2025-01-09 16:50:51,530 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:50:51,532 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i [2025-01-09 16:50:51,582 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d81b75328/b3820eff83054e5cb70c9456a91dff59/FLAG512918f7c [2025-01-09 16:50:52,063 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d81b75328/b3820eff83054e5cb70c9456a91dff59 [2025-01-09 16:50:52,065 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:50:52,066 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:50:52,066 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:50:52,066 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:50:52,071 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:50:52,072 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:50:52" (1/1) ... [2025-01-09 16:50:52,072 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35289ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:52, skipping insertion in model container [2025-01-09 16:50:52,072 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:50:52" (1/1) ... [2025-01-09 16:50:52,150 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:50:53,657 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[193617,193630] [2025-01-09 16:50:53,658 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[193693,193706] [2025-01-09 16:50:53,688 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[196266,196279] [2025-01-09 16:50:53,688 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[196373,196386] [2025-01-09 16:50:53,689 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[196444,196457] [2025-01-09 16:50:53,689 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[196555,196568] [2025-01-09 16:50:53,689 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[196668,196681] [2025-01-09 16:50:53,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:50:53,696 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:50:53,760 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4308] [2025-01-09 16:50:53,761 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4310] [2025-01-09 16:50:53,761 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4315] [2025-01-09 16:50:53,762 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4317] [2025-01-09 16:50:53,762 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4323] [2025-01-09 16:50:53,762 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4325] [2025-01-09 16:50:53,762 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4331] [2025-01-09 16:50:53,763 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4333] [2025-01-09 16:50:53,763 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4339] [2025-01-09 16:50:53,763 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4341] [2025-01-09 16:50:53,763 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4347] [2025-01-09 16:50:53,764 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4349] [2025-01-09 16:50:53,764 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4355] [2025-01-09 16:50:53,764 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4357] [2025-01-09 16:50:53,764 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4363] [2025-01-09 16:50:53,764 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4365] [2025-01-09 16:50:53,765 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4370] [2025-01-09 16:50:53,765 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4372] [2025-01-09 16:50:53,765 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4377] [2025-01-09 16:50:53,765 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4379] [2025-01-09 16:50:53,765 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4384] [2025-01-09 16:50:53,765 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4386] [2025-01-09 16:50:53,765 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4391] [2025-01-09 16:50:53,766 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4393] [2025-01-09 16:50:53,766 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4398] [2025-01-09 16:50:53,766 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4400] [2025-01-09 16:50:53,766 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4405] [2025-01-09 16:50:53,766 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4408] [2025-01-09 16:50:53,766 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4414] [2025-01-09 16:50:53,767 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4417] [2025-01-09 16:50:53,767 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4423] [2025-01-09 16:50:53,768 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4426] [2025-01-09 16:50:53,768 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4432] [2025-01-09 16:50:53,768 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4435] [2025-01-09 16:50:53,768 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4441] [2025-01-09 16:50:53,769 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4444] [2025-01-09 16:50:53,769 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4450] [2025-01-09 16:50:53,769 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4453] [2025-01-09 16:50:53,769 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4460] [2025-01-09 16:50:53,770 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4463] [2025-01-09 16:50:53,770 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4470] [2025-01-09 16:50:53,770 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4473] [2025-01-09 16:50:53,771 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4480] [2025-01-09 16:50:53,771 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4483] [2025-01-09 16:50:53,771 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4490] [2025-01-09 16:50:53,772 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4493] [2025-01-09 16:50:53,772 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4500] [2025-01-09 16:50:53,772 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4503] [2025-01-09 16:50:53,772 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4510] [2025-01-09 16:50:53,773 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4513] [2025-01-09 16:50:53,773 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4519] [2025-01-09 16:50:53,773 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4522] [2025-01-09 16:50:53,773 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4528] [2025-01-09 16:50:53,774 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4531] [2025-01-09 16:50:53,774 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4537] [2025-01-09 16:50:53,774 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4540] [2025-01-09 16:50:53,774 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4546] [2025-01-09 16:50:53,775 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4549] [2025-01-09 16:50:53,775 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4555] [2025-01-09 16:50:53,775 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4558] [2025-01-09 16:50:53,776 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4564] [2025-01-09 16:50:53,776 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4567] [2025-01-09 16:50:53,776 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4573] [2025-01-09 16:50:53,776 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4576] [2025-01-09 16:50:53,777 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4582] [2025-01-09 16:50:53,777 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4585] [2025-01-09 16:50:53,777 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4591] [2025-01-09 16:50:53,778 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4594] [2025-01-09 16:50:53,778 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4600] [2025-01-09 16:50:53,778 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4603] [2025-01-09 16:50:53,778 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4609] [2025-01-09 16:50:53,779 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4612] [2025-01-09 16:50:53,779 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4618] [2025-01-09 16:50:53,779 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4621] [2025-01-09 16:50:53,779 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4627] [2025-01-09 16:50:53,780 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4630] [2025-01-09 16:50:53,780 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4636] [2025-01-09 16:50:53,780 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4639] [2025-01-09 16:50:53,780 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4645] [2025-01-09 16:50:53,781 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4648] [2025-01-09 16:50:53,781 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4654] [2025-01-09 16:50:53,781 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4656] [2025-01-09 16:50:53,781 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4662] [2025-01-09 16:50:53,782 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4664] [2025-01-09 16:50:53,782 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4670] [2025-01-09 16:50:53,782 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4672] [2025-01-09 16:50:53,782 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4678] [2025-01-09 16:50:53,783 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4680] [2025-01-09 16:50:53,783 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4686] [2025-01-09 16:50:53,783 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4688] [2025-01-09 16:50:53,783 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4694] [2025-01-09 16:50:53,783 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4696] [2025-01-09 16:50:53,784 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4702] [2025-01-09 16:50:53,784 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4704] [2025-01-09 16:50:53,784 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4710] [2025-01-09 16:50:53,784 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4712] [2025-01-09 16:50:53,785 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4718] [2025-01-09 16:50:53,785 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4720] [2025-01-09 16:50:53,785 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4726] [2025-01-09 16:50:53,785 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4728] [2025-01-09 16:50:53,813 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[193617,193630] [2025-01-09 16:50:53,813 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[193693,193706] [2025-01-09 16:50:53,824 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[196266,196279] [2025-01-09 16:50:53,825 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[196373,196386] [2025-01-09 16:50:53,825 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[196444,196457] [2025-01-09 16:50:53,825 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[196555,196568] [2025-01-09 16:50:53,826 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[196668,196681] [2025-01-09 16:50:53,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:50:54,073 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:50:54,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:54 WrapperNode [2025-01-09 16:50:54,074 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:50:54,074 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:50:54,074 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:50:54,075 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:50:54,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:54" (1/1) ... [2025-01-09 16:50:54,126 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:54" (1/1) ... [2025-01-09 16:50:54,168 INFO L138 Inliner]: procedures = 914, calls = 950, calls flagged for inlining = 815, calls inlined = 57, statements flattened = 628 [2025-01-09 16:50:54,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:50:54,172 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:50:54,172 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:50:54,172 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:50:54,182 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:54" (1/1) ... [2025-01-09 16:50:54,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:54" (1/1) ... [2025-01-09 16:50:54,189 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:54" (1/1) ... [2025-01-09 16:50:54,223 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-01-09 16:50:54,223 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:54" (1/1) ... [2025-01-09 16:50:54,223 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:54" (1/1) ... [2025-01-09 16:50:54,234 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:54" (1/1) ... [2025-01-09 16:50:54,235 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:54" (1/1) ... [2025-01-09 16:50:54,243 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:54" (1/1) ... [2025-01-09 16:50:54,245 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:54" (1/1) ... [2025-01-09 16:50:54,250 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:54" (1/1) ... [2025-01-09 16:50:54,257 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:50:54,262 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:50:54,262 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:50:54,262 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:50:54,263 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:54" (1/1) ... [2025-01-09 16:50:54,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:50:54,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:50:54,305 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:50:54,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:50:54,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:50:54,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:50:54,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 16:50:54,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 16:50:54,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 16:50:54,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:50:54,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 16:50:54,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 16:50:54,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 16:50:54,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 16:50:54,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 16:50:54,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:50:54,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:50:54,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 16:50:54,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 16:50:54,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 16:50:54,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 16:50:54,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 16:50:54,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 16:50:54,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:50:54,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:50:54,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 16:50:54,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 16:50:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 16:50:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 16:50:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2025-01-09 16:50:54,329 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2025-01-09 16:50:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 16:50:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 16:50:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 16:50:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 16:50:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-09 16:50:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:50:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:50:54,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 16:50:54,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 16:50:54,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 16:50:54,332 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:50:54,457 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:50:54,459 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:50:55,011 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:50:55,011 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:50:55,372 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:50:55,372 INFO L312 CfgBuilder]: Removed 20 assume(true) statements. [2025-01-09 16:50:55,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:50:55 BoogieIcfgContainer [2025-01-09 16:50:55,373 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:50:55,374 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:50:55,374 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:50:55,381 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:50:55,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:50:52" (1/3) ... [2025-01-09 16:50:55,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20695884 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:50:55, skipping insertion in model container [2025-01-09 16:50:55,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:54" (2/3) ... [2025-01-09 16:50:55,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20695884 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:50:55, skipping insertion in model container [2025-01-09 16:50:55,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:50:55" (3/3) ... [2025-01-09 16:50:55,382 INFO L128 eAbstractionObserver]: Analyzing ICFG bounded_mpmc_check_full.i [2025-01-09 16:50:55,404 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:50:55,406 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bounded_mpmc_check_full.i that has 2 procedures, 125 locations, 1 initial locations, 23 loop locations, and 7 error locations. [2025-01-09 16:50:55,406 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:50:55,482 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 16:50:55,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 179 transitions, 365 flow [2025-01-09 16:50:55,579 INFO L124 PetriNetUnfolderBase]: 96/308 cut-off events. [2025-01-09 16:50:55,581 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 16:50:55,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 313 conditions, 308 events. 96/308 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 891 event pairs, 0 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 153. Up to 6 conditions per place. [2025-01-09 16:50:55,588 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 179 transitions, 365 flow [2025-01-09 16:50:55,595 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 179 transitions, 365 flow [2025-01-09 16:50:55,600 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:50:55,610 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;@5ed4e693, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:50:55,610 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-09 16:50:55,614 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:50:55,614 INFO L124 PetriNetUnfolderBase]: 3/7 cut-off events. [2025-01-09 16:50:55,614 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:50:55,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:50:55,614 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-09 16:50:55,615 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:50:55,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:50:55,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1892023, now seen corresponding path program 1 times [2025-01-09 16:50:55,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:50:55,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643280643] [2025-01-09 16:50:55,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:50:55,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:50:55,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-09 16:50:55,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-09 16:50:55,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:50:55,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:50:55,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:50:55,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:50:55,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643280643] [2025-01-09 16:50:55,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643280643] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:50:55,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:50:55,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:50:55,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609734259] [2025-01-09 16:50:55,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:50:55,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:50:55,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:50:55,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:50:55,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:50:55,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 179 [2025-01-09 16:50:55,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 179 transitions, 365 flow. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:50:55,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:50:55,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 179 [2025-01-09 16:50:55,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:50:56,374 INFO L124 PetriNetUnfolderBase]: 1229/2740 cut-off events. [2025-01-09 16:50:56,374 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 16:50:56,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4974 conditions, 2740 events. 1229/2740 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 15165 event pairs, 864 based on Foata normal form. 510/2776 useless extension candidates. Maximal degree in co-relation 4778. Up to 2220 conditions per place. [2025-01-09 16:50:56,392 INFO L140 encePairwiseOnDemand]: 136/179 looper letters, 91 selfloop transitions, 2 changer transitions 5/136 dead transitions. [2025-01-09 16:50:56,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 136 transitions, 469 flow [2025-01-09 16:50:56,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:50:56,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:50:56,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2025-01-09 16:50:56,402 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48789571694599626 [2025-01-09 16:50:56,403 INFO L175 Difference]: Start difference. First operand has 128 places, 179 transitions, 365 flow. Second operand 3 states and 262 transitions. [2025-01-09 16:50:56,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 136 transitions, 469 flow [2025-01-09 16:50:56,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 136 transitions, 469 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:50:56,409 INFO L231 Difference]: Finished difference. Result has 128 places, 131 transitions, 273 flow [2025-01-09 16:50:56,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=273, PETRI_PLACES=128, PETRI_TRANSITIONS=131} [2025-01-09 16:50:56,412 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 0 predicate places. [2025-01-09 16:50:56,412 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 131 transitions, 273 flow [2025-01-09 16:50:56,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:50:56,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:50:56,413 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 16:50:56,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:50:56,413 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:50:56,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:50:56,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1818377484, now seen corresponding path program 1 times [2025-01-09 16:50:56,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:50:56,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921859552] [2025-01-09 16:50:56,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:50:56,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:50:56,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 16:50:56,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 16:50:56,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:50:56,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:50:56,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:50:56,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:50:56,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921859552] [2025-01-09 16:50:56,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921859552] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:50:56,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:50:56,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:50:56,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954468909] [2025-01-09 16:50:56,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:50:56,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:50:56,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:50:56,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:50:56,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:50:56,500 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 179 [2025-01-09 16:50:56,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 131 transitions, 273 flow. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:50:56,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:50:56,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 179 [2025-01-09 16:50:56,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:50:56,952 INFO L124 PetriNetUnfolderBase]: 1189/2608 cut-off events. [2025-01-09 16:50:56,952 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 16:50:56,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4769 conditions, 2608 events. 1189/2608 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 14385 event pairs, 832 based on Foata normal form. 1/2144 useless extension candidates. Maximal degree in co-relation 4739. Up to 2144 conditions per place. [2025-01-09 16:50:56,977 INFO L140 encePairwiseOnDemand]: 176/179 looper letters, 91 selfloop transitions, 2 changer transitions 0/129 dead transitions. [2025-01-09 16:50:56,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 129 transitions, 455 flow [2025-01-09 16:50:56,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:50:56,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:50:56,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 220 transitions. [2025-01-09 16:50:56,978 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.409683426443203 [2025-01-09 16:50:56,978 INFO L175 Difference]: Start difference. First operand has 128 places, 131 transitions, 273 flow. Second operand 3 states and 220 transitions. [2025-01-09 16:50:56,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 129 transitions, 455 flow [2025-01-09 16:50:56,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 129 transitions, 451 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:50:56,984 INFO L231 Difference]: Finished difference. Result has 121 places, 129 transitions, 269 flow [2025-01-09 16:50:56,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, 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=269, PETRI_PLACES=121, PETRI_TRANSITIONS=129} [2025-01-09 16:50:56,984 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, -7 predicate places. [2025-01-09 16:50:56,984 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 129 transitions, 269 flow [2025-01-09 16:50:56,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:50:56,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:50:56,985 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:50:56,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:50:56,985 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:50:56,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:50:56,989 INFO L85 PathProgramCache]: Analyzing trace with hash 516919833, now seen corresponding path program 1 times [2025-01-09 16:50:56,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:50:56,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985051515] [2025-01-09 16:50:56,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:50:56,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:50:57,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 16:50:57,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 16:50:57,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:50:57,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:50:57,060 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:50:57,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 16:50:57,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 16:50:57,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:50:57,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:50:57,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:50:57,160 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:50:57,160 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-01-09 16:50:57,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2025-01-09 16:50:57,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2025-01-09 16:50:57,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-01-09 16:50:57,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-01-09 16:50:57,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-01-09 16:50:57,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2025-01-09 16:50:57,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2025-01-09 16:50:57,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:50:57,166 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 16:50:57,167 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:50:57,167 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 16:50:57,275 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 16:50:57,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 202 transitions, 420 flow [2025-01-09 16:50:57,312 INFO L124 PetriNetUnfolderBase]: 187/592 cut-off events. [2025-01-09 16:50:57,312 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 16:50:57,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 604 conditions, 592 events. 187/592 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2420 event pairs, 0 based on Foata normal form. 0/379 useless extension candidates. Maximal degree in co-relation 310. Up to 12 conditions per place. [2025-01-09 16:50:57,315 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 202 transitions, 420 flow [2025-01-09 16:50:57,317 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 202 transitions, 420 flow [2025-01-09 16:50:57,318 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:50:57,318 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;@5ed4e693, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:50:57,318 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-09 16:50:57,320 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:50:57,320 INFO L124 PetriNetUnfolderBase]: 3/7 cut-off events. [2025-01-09 16:50:57,320 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:50:57,320 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:50:57,320 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-09 16:50:57,320 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:50:57,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:50:57,320 INFO L85 PathProgramCache]: Analyzing trace with hash 2092609, now seen corresponding path program 1 times [2025-01-09 16:50:57,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:50:57,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783175194] [2025-01-09 16:50:57,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:50:57,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:50:57,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-09 16:50:57,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-09 16:50:57,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:50:57,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:50:57,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:50:57,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:50:57,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783175194] [2025-01-09 16:50:57,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783175194] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:50:57,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:50:57,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:50:57,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992751] [2025-01-09 16:50:57,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:50:57,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:50:57,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:50:57,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:50:57,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:50:57,392 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 202 [2025-01-09 16:50:57,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 202 transitions, 420 flow. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:50:57,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:50:57,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 202 [2025-01-09 16:50:57,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:51:02,442 INFO L124 PetriNetUnfolderBase]: 41903/66721 cut-off events. [2025-01-09 16:51:02,442 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2025-01-09 16:51:02,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126529 conditions, 66721 events. 41903/66721 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 889. Compared 471333 event pairs, 31376 based on Foata normal form. 9102/63581 useless extension candidates. Maximal degree in co-relation 97142. Up to 59707 conditions per place. [2025-01-09 16:51:02,847 INFO L140 encePairwiseOnDemand]: 158/202 looper letters, 113 selfloop transitions, 2 changer transitions 5/158 dead transitions. [2025-01-09 16:51:02,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 158 transitions, 566 flow [2025-01-09 16:51:02,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:51:02,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:51:02,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 285 transitions. [2025-01-09 16:51:02,853 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47029702970297027 [2025-01-09 16:51:02,853 INFO L175 Difference]: Start difference. First operand has 147 places, 202 transitions, 420 flow. Second operand 3 states and 285 transitions. [2025-01-09 16:51:02,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 158 transitions, 566 flow [2025-01-09 16:51:02,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 158 transitions, 566 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:51:02,856 INFO L231 Difference]: Finished difference. Result has 147 places, 153 transitions, 326 flow [2025-01-09 16:51:02,856 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=326, PETRI_PLACES=147, PETRI_TRANSITIONS=153} [2025-01-09 16:51:02,861 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 0 predicate places. [2025-01-09 16:51:02,861 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 153 transitions, 326 flow [2025-01-09 16:51:02,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:02,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:51:02,861 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 16:51:02,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:51:02,861 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:51:02,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:51:02,861 INFO L85 PathProgramCache]: Analyzing trace with hash 2011147094, now seen corresponding path program 1 times [2025-01-09 16:51:02,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:51:02,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355447035] [2025-01-09 16:51:02,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:51:02,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:51:02,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 16:51:02,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 16:51:02,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:51:02,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:51:02,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:51:02,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:51:02,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355447035] [2025-01-09 16:51:02,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355447035] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:51:02,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:51:02,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:51:02,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517614269] [2025-01-09 16:51:02,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:51:02,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:51:02,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:51:02,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:51:02,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:51:02,927 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 202 [2025-01-09 16:51:02,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 153 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:02,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:51:02,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 202 [2025-01-09 16:51:02,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:51:07,575 INFO L124 PetriNetUnfolderBase]: 40463/63659 cut-off events. [2025-01-09 16:51:07,575 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2025-01-09 16:51:07,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121382 conditions, 63659 events. 40463/63659 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 889. Compared 442623 event pairs, 30224 based on Foata normal form. 1/51707 useless extension candidates. Maximal degree in co-relation 121351. Up to 57619 conditions per place. [2025-01-09 16:51:07,840 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 113 selfloop transitions, 2 changer transitions 0/151 dead transitions. [2025-01-09 16:51:07,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 151 transitions, 552 flow [2025-01-09 16:51:07,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:51:07,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:51:07,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 242 transitions. [2025-01-09 16:51:07,843 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39933993399339934 [2025-01-09 16:51:07,843 INFO L175 Difference]: Start difference. First operand has 147 places, 153 transitions, 326 flow. Second operand 3 states and 242 transitions. [2025-01-09 16:51:07,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 151 transitions, 552 flow [2025-01-09 16:51:07,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 151 transitions, 548 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:51:07,845 INFO L231 Difference]: Finished difference. Result has 140 places, 151 transitions, 322 flow [2025-01-09 16:51:07,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, 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=322, PETRI_PLACES=140, PETRI_TRANSITIONS=151} [2025-01-09 16:51:07,846 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, -7 predicate places. [2025-01-09 16:51:07,846 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 151 transitions, 322 flow [2025-01-09 16:51:07,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:07,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:51:07,847 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-01-09 16:51:07,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:51:07,847 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:51:07,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:51:07,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1921153907, now seen corresponding path program 1 times [2025-01-09 16:51:07,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:51:07,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950354025] [2025-01-09 16:51:07,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:51:07,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:51:07,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 16:51:07,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 16:51:07,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:51:07,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:51:08,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:51:08,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:51:08,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950354025] [2025-01-09 16:51:08,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950354025] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:51:08,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:51:08,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:51:08,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663186643] [2025-01-09 16:51:08,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:51:08,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:51:08,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:51:08,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:51:08,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:51:08,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 202 [2025-01-09 16:51:08,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 151 transitions, 322 flow. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:08,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:51:08,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 202 [2025-01-09 16:51:08,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:51:12,287 INFO L124 PetriNetUnfolderBase]: 39765/66688 cut-off events. [2025-01-09 16:51:12,287 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2025-01-09 16:51:12,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123424 conditions, 66688 events. 39765/66688 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 1016. Compared 519632 event pairs, 1 based on Foata normal form. 0/54660 useless extension candidates. Maximal degree in co-relation 123393. Up to 54878 conditions per place. [2025-01-09 16:51:12,517 INFO L140 encePairwiseOnDemand]: 198/202 looper letters, 213 selfloop transitions, 4 changer transitions 0/252 dead transitions. [2025-01-09 16:51:12,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 252 transitions, 956 flow [2025-01-09 16:51:12,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:51:12,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:51:12,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 435 transitions. [2025-01-09 16:51:12,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4306930693069307 [2025-01-09 16:51:12,519 INFO L175 Difference]: Start difference. First operand has 140 places, 151 transitions, 322 flow. Second operand 5 states and 435 transitions. [2025-01-09 16:51:12,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 252 transitions, 956 flow [2025-01-09 16:51:12,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 252 transitions, 948 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 16:51:12,525 INFO L231 Difference]: Finished difference. Result has 140 places, 151 transitions, 324 flow [2025-01-09 16:51:12,525 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=324, PETRI_PLACES=140, PETRI_TRANSITIONS=151} [2025-01-09 16:51:12,526 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, -7 predicate places. [2025-01-09 16:51:12,526 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 151 transitions, 324 flow [2025-01-09 16:51:12,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:12,527 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:51:12,527 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-01-09 16:51:12,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:51:12,527 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:51:12,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:51:12,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1331498791, now seen corresponding path program 1 times [2025-01-09 16:51:12,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:51:12,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547379533] [2025-01-09 16:51:12,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:51:12,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:51:12,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 16:51:12,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:51:12,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:51:12,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:51:12,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:51:12,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:51:12,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547379533] [2025-01-09 16:51:12,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547379533] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:51:12,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:51:12,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:51:12,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334694806] [2025-01-09 16:51:12,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:51:12,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:51:12,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:51:12,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:51:12,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:51:12,651 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 202 [2025-01-09 16:51:12,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 151 transitions, 324 flow. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:12,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:51:12,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 202 [2025-01-09 16:51:12,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:51:13,685 INFO L124 PetriNetUnfolderBase]: 4813/8905 cut-off events. [2025-01-09 16:51:13,686 INFO L125 PetriNetUnfolderBase]: For 1202/1202 co-relation queries the response was YES. [2025-01-09 16:51:13,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17683 conditions, 8905 events. 4813/8905 cut-off events. For 1202/1202 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 55031 event pairs, 2448 based on Foata normal form. 0/7451 useless extension candidates. Maximal degree in co-relation 10514. Up to 5805 conditions per place. [2025-01-09 16:51:13,710 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 158 selfloop transitions, 2 changer transitions 0/195 dead transitions. [2025-01-09 16:51:13,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 195 transitions, 736 flow [2025-01-09 16:51:13,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:51:13,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:51:13,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 289 transitions. [2025-01-09 16:51:13,712 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4768976897689769 [2025-01-09 16:51:13,712 INFO L175 Difference]: Start difference. First operand has 140 places, 151 transitions, 324 flow. Second operand 3 states and 289 transitions. [2025-01-09 16:51:13,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 195 transitions, 736 flow [2025-01-09 16:51:13,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 195 transitions, 734 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:51:13,717 INFO L231 Difference]: Finished difference. Result has 142 places, 152 transitions, 334 flow [2025-01-09 16:51:13,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=334, PETRI_PLACES=142, PETRI_TRANSITIONS=152} [2025-01-09 16:51:13,718 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, -5 predicate places. [2025-01-09 16:51:13,719 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 152 transitions, 334 flow [2025-01-09 16:51:13,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:13,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:51:13,720 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-01-09 16:51:13,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:51:13,720 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:51:13,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:51:13,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1873052181, now seen corresponding path program 1 times [2025-01-09 16:51:13,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:51:13,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699525987] [2025-01-09 16:51:13,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:51:13,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:51:13,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 16:51:13,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 16:51:13,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:51:13,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:51:13,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:51:13,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:51:13,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699525987] [2025-01-09 16:51:13,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699525987] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:51:13,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:51:13,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:51:13,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809585116] [2025-01-09 16:51:13,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:51:13,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:51:13,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:51:13,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:51:13,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:51:13,850 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 202 [2025-01-09 16:51:13,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 152 transitions, 334 flow. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:13,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:51:13,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 202 [2025-01-09 16:51:13,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:51:15,276 INFO L124 PetriNetUnfolderBase]: 8074/13963 cut-off events. [2025-01-09 16:51:15,276 INFO L125 PetriNetUnfolderBase]: For 5079/5079 co-relation queries the response was YES. [2025-01-09 16:51:15,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28807 conditions, 13963 events. 8074/13963 cut-off events. For 5079/5079 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 86045 event pairs, 3708 based on Foata normal form. 0/11810 useless extension candidates. Maximal degree in co-relation 12658. Up to 7817 conditions per place. [2025-01-09 16:51:15,325 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 217 selfloop transitions, 2 changer transitions 0/254 dead transitions. [2025-01-09 16:51:15,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 254 transitions, 997 flow [2025-01-09 16:51:15,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:51:15,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:51:15,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2025-01-09 16:51:15,328 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.570957095709571 [2025-01-09 16:51:15,328 INFO L175 Difference]: Start difference. First operand has 142 places, 152 transitions, 334 flow. Second operand 3 states and 346 transitions. [2025-01-09 16:51:15,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 254 transitions, 997 flow [2025-01-09 16:51:15,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 254 transitions, 993 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:51:15,339 INFO L231 Difference]: Finished difference. Result has 144 places, 153 transitions, 344 flow [2025-01-09 16:51:15,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=144, PETRI_TRANSITIONS=153} [2025-01-09 16:51:15,340 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, -3 predicate places. [2025-01-09 16:51:15,340 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 153 transitions, 344 flow [2025-01-09 16:51:15,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:15,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:51:15,340 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-01-09 16:51:15,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:51:15,340 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:51:15,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:51:15,341 INFO L85 PathProgramCache]: Analyzing trace with hash 569842952, now seen corresponding path program 1 times [2025-01-09 16:51:15,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:51:15,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159030322] [2025-01-09 16:51:15,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:51:15,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:51:15,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 16:51:15,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 16:51:15,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:51:15,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:51:15,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:51:15,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:51:15,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159030322] [2025-01-09 16:51:15,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159030322] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:51:15,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:51:15,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:51:15,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068876394] [2025-01-09 16:51:15,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:51:15,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:51:15,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:51:15,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:51:15,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:51:15,438 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 202 [2025-01-09 16:51:15,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 153 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:15,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:51:15,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 202 [2025-01-09 16:51:15,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:51:17,016 INFO L124 PetriNetUnfolderBase]: 13216/22288 cut-off events. [2025-01-09 16:51:17,016 INFO L125 PetriNetUnfolderBase]: For 7404/7404 co-relation queries the response was YES. [2025-01-09 16:51:17,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47306 conditions, 22288 events. 13216/22288 cut-off events. For 7404/7404 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 140344 event pairs, 6104 based on Foata normal form. 0/19164 useless extension candidates. Maximal degree in co-relation 35894. Up to 12908 conditions per place. [2025-01-09 16:51:17,115 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 216 selfloop transitions, 2 changer transitions 0/253 dead transitions. [2025-01-09 16:51:17,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 253 transitions, 1004 flow [2025-01-09 16:51:17,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:51:17,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:51:17,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 344 transitions. [2025-01-09 16:51:17,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5676567656765676 [2025-01-09 16:51:17,117 INFO L175 Difference]: Start difference. First operand has 144 places, 153 transitions, 344 flow. Second operand 3 states and 344 transitions. [2025-01-09 16:51:17,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 253 transitions, 1004 flow [2025-01-09 16:51:17,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 253 transitions, 1000 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:51:17,124 INFO L231 Difference]: Finished difference. Result has 146 places, 154 transitions, 354 flow [2025-01-09 16:51:17,124 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=354, PETRI_PLACES=146, PETRI_TRANSITIONS=154} [2025-01-09 16:51:17,125 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, -1 predicate places. [2025-01-09 16:51:17,125 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 154 transitions, 354 flow [2025-01-09 16:51:17,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:17,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:51:17,125 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-01-09 16:51:17,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:51:17,125 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:51:17,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:51:17,126 INFO L85 PathProgramCache]: Analyzing trace with hash -665301017, now seen corresponding path program 1 times [2025-01-09 16:51:17,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:51:17,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484101484] [2025-01-09 16:51:17,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:51:17,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:51:17,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 16:51:17,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 16:51:17,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:51:17,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:51:17,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:51:17,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:51:17,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484101484] [2025-01-09 16:51:17,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484101484] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:51:17,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:51:17,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:51:17,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061189073] [2025-01-09 16:51:17,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:51:17,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:51:17,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:51:17,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:51:17,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:51:17,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 202 [2025-01-09 16:51:17,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 154 transitions, 354 flow. Second operand has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:17,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:51:17,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 202 [2025-01-09 16:51:17,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:51:19,228 INFO L124 PetriNetUnfolderBase]: 15076/25705 cut-off events. [2025-01-09 16:51:19,228 INFO L125 PetriNetUnfolderBase]: For 8881/8881 co-relation queries the response was YES. [2025-01-09 16:51:19,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55121 conditions, 25705 events. 15076/25705 cut-off events. For 8881/8881 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 167740 event pairs, 10169 based on Foata normal form. 0/22500 useless extension candidates. Maximal degree in co-relation 42855. Up to 20735 conditions per place. [2025-01-09 16:51:19,359 INFO L140 encePairwiseOnDemand]: 197/202 looper letters, 288 selfloop transitions, 4 changer transitions 0/327 dead transitions. [2025-01-09 16:51:19,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 327 transitions, 1342 flow [2025-01-09 16:51:19,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:51:19,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:51:19,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 457 transitions. [2025-01-09 16:51:19,360 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5655940594059405 [2025-01-09 16:51:19,361 INFO L175 Difference]: Start difference. First operand has 146 places, 154 transitions, 354 flow. Second operand 4 states and 457 transitions. [2025-01-09 16:51:19,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 327 transitions, 1342 flow [2025-01-09 16:51:19,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 327 transitions, 1336 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:51:19,371 INFO L231 Difference]: Finished difference. Result has 150 places, 157 transitions, 380 flow [2025-01-09 16:51:19,371 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=380, PETRI_PLACES=150, PETRI_TRANSITIONS=157} [2025-01-09 16:51:19,373 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 3 predicate places. [2025-01-09 16:51:19,373 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 157 transitions, 380 flow [2025-01-09 16:51:19,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:19,373 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:51:19,373 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-01-09 16:51:19,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:51:19,373 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:51:19,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:51:19,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1063383234, now seen corresponding path program 1 times [2025-01-09 16:51:19,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:51:19,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968486367] [2025-01-09 16:51:19,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:51:19,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:51:19,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 16:51:19,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 16:51:19,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:51:19,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:51:19,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:51:19,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:51:19,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968486367] [2025-01-09 16:51:19,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968486367] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:51:19,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:51:19,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:51:19,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772148177] [2025-01-09 16:51:19,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:51:19,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:51:19,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:51:19,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:51:19,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:51:19,507 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 202 [2025-01-09 16:51:19,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 157 transitions, 380 flow. Second operand has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:19,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:51:19,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 202 [2025-01-09 16:51:19,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:51:21,899 INFO L124 PetriNetUnfolderBase]: 17170/29203 cut-off events. [2025-01-09 16:51:21,899 INFO L125 PetriNetUnfolderBase]: For 14215/14215 co-relation queries the response was YES. [2025-01-09 16:51:21,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67060 conditions, 29203 events. 17170/29203 cut-off events. For 14215/14215 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 191442 event pairs, 11813 based on Foata normal form. 0/26188 useless extension candidates. Maximal degree in co-relation 55644. Up to 23687 conditions per place. [2025-01-09 16:51:22,028 INFO L140 encePairwiseOnDemand]: 197/202 looper letters, 291 selfloop transitions, 4 changer transitions 0/330 dead transitions. [2025-01-09 16:51:22,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 330 transitions, 1404 flow [2025-01-09 16:51:22,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:51:22,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:51:22,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 453 transitions. [2025-01-09 16:51:22,030 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5606435643564357 [2025-01-09 16:51:22,030 INFO L175 Difference]: Start difference. First operand has 150 places, 157 transitions, 380 flow. Second operand 4 states and 453 transitions. [2025-01-09 16:51:22,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 330 transitions, 1404 flow [2025-01-09 16:51:22,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 330 transitions, 1398 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:51:22,057 INFO L231 Difference]: Finished difference. Result has 154 places, 160 transitions, 406 flow [2025-01-09 16:51:22,057 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=406, PETRI_PLACES=154, PETRI_TRANSITIONS=160} [2025-01-09 16:51:22,058 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 7 predicate places. [2025-01-09 16:51:22,058 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 160 transitions, 406 flow [2025-01-09 16:51:22,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:22,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:51:22,058 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-01-09 16:51:22,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:51:22,059 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:51:22,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:51:22,059 INFO L85 PathProgramCache]: Analyzing trace with hash -123766149, now seen corresponding path program 1 times [2025-01-09 16:51:22,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:51:22,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20903413] [2025-01-09 16:51:22,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:51:22,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:51:22,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 16:51:22,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 16:51:22,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:51:22,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:51:22,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:51:22,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:51:22,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20903413] [2025-01-09 16:51:22,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20903413] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:51:22,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:51:22,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:51:22,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082624681] [2025-01-09 16:51:22,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:51:22,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:51:22,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:51:22,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:51:22,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:51:22,186 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 202 [2025-01-09 16:51:22,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 160 transitions, 406 flow. Second operand has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:22,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:51:22,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 202 [2025-01-09 16:51:22,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:51:24,471 INFO L124 PetriNetUnfolderBase]: 19282/32737 cut-off events. [2025-01-09 16:51:24,472 INFO L125 PetriNetUnfolderBase]: For 18081/18081 co-relation queries the response was YES. [2025-01-09 16:51:24,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80578 conditions, 32737 events. 19282/32737 cut-off events. For 18081/18081 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 218776 event pairs, 13691 based on Foata normal form. 0/29954 useless extension candidates. Maximal degree in co-relation 67348. Up to 26999 conditions per place. [2025-01-09 16:51:24,620 INFO L140 encePairwiseOnDemand]: 197/202 looper letters, 300 selfloop transitions, 4 changer transitions 0/339 dead transitions. [2025-01-09 16:51:24,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 339 transitions, 1476 flow [2025-01-09 16:51:24,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:51:24,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:51:24,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 457 transitions. [2025-01-09 16:51:24,622 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5655940594059405 [2025-01-09 16:51:24,622 INFO L175 Difference]: Start difference. First operand has 154 places, 160 transitions, 406 flow. Second operand 4 states and 457 transitions. [2025-01-09 16:51:24,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 339 transitions, 1476 flow [2025-01-09 16:51:24,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 339 transitions, 1470 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:51:24,719 INFO L231 Difference]: Finished difference. Result has 158 places, 163 transitions, 438 flow [2025-01-09 16:51:24,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=438, PETRI_PLACES=158, PETRI_TRANSITIONS=163} [2025-01-09 16:51:24,721 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 11 predicate places. [2025-01-09 16:51:24,721 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 163 transitions, 438 flow [2025-01-09 16:51:24,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:24,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:51:24,721 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-01-09 16:51:24,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:51:24,721 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:51:24,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:51:24,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1095225989, now seen corresponding path program 1 times [2025-01-09 16:51:24,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:51:24,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511960649] [2025-01-09 16:51:24,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:51:24,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:51:24,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 16:51:24,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 16:51:24,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:51:24,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:51:24,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:51:24,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:51:24,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511960649] [2025-01-09 16:51:24,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511960649] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:51:24,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:51:24,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:51:24,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315647664] [2025-01-09 16:51:24,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:51:24,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:51:24,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:51:24,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:51:24,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:51:24,826 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 202 [2025-01-09 16:51:24,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 163 transitions, 438 flow. Second operand has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:24,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:51:24,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 202 [2025-01-09 16:51:24,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:51:27,830 INFO L124 PetriNetUnfolderBase]: 21628/36631 cut-off events. [2025-01-09 16:51:27,831 INFO L125 PetriNetUnfolderBase]: For 27937/27937 co-relation queries the response was YES. [2025-01-09 16:51:27,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95680 conditions, 36631 events. 21628/36631 cut-off events. For 27937/27937 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 247209 event pairs, 15587 based on Foata normal form. 0/34134 useless extension candidates. Maximal degree in co-relation 80924. Up to 30347 conditions per place. [2025-01-09 16:51:28,068 INFO L140 encePairwiseOnDemand]: 197/202 looper letters, 303 selfloop transitions, 4 changer transitions 0/342 dead transitions. [2025-01-09 16:51:28,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 342 transitions, 1556 flow [2025-01-09 16:51:28,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:51:28,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:51:28,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 453 transitions. [2025-01-09 16:51:28,070 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5606435643564357 [2025-01-09 16:51:28,070 INFO L175 Difference]: Start difference. First operand has 158 places, 163 transitions, 438 flow. Second operand 4 states and 453 transitions. [2025-01-09 16:51:28,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 342 transitions, 1556 flow [2025-01-09 16:51:28,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 342 transitions, 1532 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-01-09 16:51:28,211 INFO L231 Difference]: Finished difference. Result has 162 places, 166 transitions, 464 flow [2025-01-09 16:51:28,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=464, PETRI_PLACES=162, PETRI_TRANSITIONS=166} [2025-01-09 16:51:28,212 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 15 predicate places. [2025-01-09 16:51:28,212 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 166 transitions, 464 flow [2025-01-09 16:51:28,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:28,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:51:28,213 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-01-09 16:51:28,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 16:51:28,213 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:51:28,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:51:28,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1671268153, now seen corresponding path program 1 times [2025-01-09 16:51:28,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:51:28,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572851088] [2025-01-09 16:51:28,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:51:28,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:51:28,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 16:51:28,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 16:51:28,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:51:28,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:51:28,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-01-09 16:51:28,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:51:28,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572851088] [2025-01-09 16:51:28,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572851088] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:51:28,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:51:28,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:51:28,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716737892] [2025-01-09 16:51:28,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:51:28,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:51:28,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:51:28,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:51:28,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:51:28,376 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 202 [2025-01-09 16:51:28,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 166 transitions, 464 flow. Second operand has 4 states, 4 states have (on average 53.75) internal successors, (215), 4 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:28,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:51:28,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 202 [2025-01-09 16:51:28,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:51:31,994 INFO L124 PetriNetUnfolderBase]: 30592/49612 cut-off events. [2025-01-09 16:51:31,994 INFO L125 PetriNetUnfolderBase]: For 43178/43178 co-relation queries the response was YES. [2025-01-09 16:51:32,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137707 conditions, 49612 events. 30592/49612 cut-off events. For 43178/43178 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 325148 event pairs, 10199 based on Foata normal form. 230/47340 useless extension candidates. Maximal degree in co-relation 116961. Up to 20261 conditions per place. [2025-01-09 16:51:32,313 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 357 selfloop transitions, 3 changer transitions 0/395 dead transitions. [2025-01-09 16:51:32,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 395 transitions, 1874 flow [2025-01-09 16:51:32,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:51:32,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:51:32,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 490 transitions. [2025-01-09 16:51:32,315 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6064356435643564 [2025-01-09 16:51:32,315 INFO L175 Difference]: Start difference. First operand has 162 places, 166 transitions, 464 flow. Second operand 4 states and 490 transitions. [2025-01-09 16:51:32,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 395 transitions, 1874 flow [2025-01-09 16:51:32,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 395 transitions, 1850 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-01-09 16:51:32,586 INFO L231 Difference]: Finished difference. Result has 165 places, 167 transitions, 472 flow [2025-01-09 16:51:32,587 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=472, PETRI_PLACES=165, PETRI_TRANSITIONS=167} [2025-01-09 16:51:32,587 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 18 predicate places. [2025-01-09 16:51:32,587 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 167 transitions, 472 flow [2025-01-09 16:51:32,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.75) internal successors, (215), 4 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:32,587 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:51:32,588 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-01-09 16:51:32,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 16:51:32,588 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:51:32,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:51:32,588 INFO L85 PathProgramCache]: Analyzing trace with hash 2053442841, now seen corresponding path program 1 times [2025-01-09 16:51:32,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:51:32,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348951222] [2025-01-09 16:51:32,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:51:32,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:51:32,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 16:51:32,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 16:51:32,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:51:32,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:51:32,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:51:32,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:51:32,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348951222] [2025-01-09 16:51:32,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348951222] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:51:32,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:51:32,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:51:32,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129714887] [2025-01-09 16:51:32,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:51:32,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:51:32,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:51:32,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:51:32,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:51:32,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 202 [2025-01-09 16:51:32,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 167 transitions, 472 flow. Second operand has 4 states, 4 states have (on average 53.75) internal successors, (215), 4 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:32,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:51:32,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 202 [2025-01-09 16:51:32,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand