./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/libvsync/rec_ticketlock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/libvsync/rec_ticketlock.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 26fb157b5325eaa996338c8b5885df439eefd4a5361a0a1d7cce4088ff8240ef --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:41:05,692 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:41:05,745 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:41:05,748 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:41:05,749 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:41:05,763 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:41:05,763 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:41:05,763 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:41:05,763 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:41:05,763 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:41:05,763 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:41:05,763 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:41:05,764 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:41:05,764 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:41:05,764 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:41:05,764 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:41:05,764 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:41:05,764 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:41:05,764 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:41:05,764 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:41:05,764 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:41:05,764 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:41:05,764 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:41:05,764 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:41:05,764 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:41:05,764 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:41:05,764 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:41:05,764 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:41:05,765 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:41:05,765 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:41:05,765 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:41:05,765 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:41:05,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:41:05,765 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:41:05,765 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:41:05,765 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:41:05,765 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:41:05,765 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:41:05,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:41:05,765 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:41:05,765 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:41:05,765 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:41:05,769 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:41:05,770 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 26fb157b5325eaa996338c8b5885df439eefd4a5361a0a1d7cce4088ff8240ef [2025-03-08 17:41:05,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:41:05,997 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:41:05,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:41:05,999 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:41:06,000 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:41:06,000 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/rec_ticketlock.i [2025-03-08 17:41:07,127 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c1cec008/b8c7f3d7630449908db0c2c19f571b14/FLAG14124a758 [2025-03-08 17:41:07,491 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:41:07,491 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/rec_ticketlock.i [2025-03-08 17:41:07,530 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c1cec008/b8c7f3d7630449908db0c2c19f571b14/FLAG14124a758 [2025-03-08 17:41:07,686 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c1cec008/b8c7f3d7630449908db0c2c19f571b14 [2025-03-08 17:41:07,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:41:07,689 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:41:07,690 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:41:07,690 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:41:07,693 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:41:07,694 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:41:07" (1/1) ... [2025-03-08 17:41:07,694 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56b8b78f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:07, skipping insertion in model container [2025-03-08 17:41:07,694 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:41:07" (1/1) ... [2025-03-08 17:41:07,746 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:41:09,006 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/rec_ticketlock.i[172521,172534] [2025-03-08 17:41:09,012 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/rec_ticketlock.i[172881,172894] [2025-03-08 17:41:09,175 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/rec_ticketlock.i[195820,195833] [2025-03-08 17:41:09,175 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/rec_ticketlock.i[195887,195900] [2025-03-08 17:41:09,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:41:09,191 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:41:09,247 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] [2025-03-08 17:41:09,248 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] [2025-03-08 17:41:09,248 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] [2025-03-08 17:41:09,249 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] [2025-03-08 17:41:09,249 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] [2025-03-08 17:41:09,249 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] [2025-03-08 17:41:09,250 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] [2025-03-08 17:41:09,250 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] [2025-03-08 17:41:09,250 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] [2025-03-08 17:41:09,250 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] [2025-03-08 17:41:09,252 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] [2025-03-08 17:41:09,253 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] [2025-03-08 17:41:09,253 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] [2025-03-08 17:41:09,253 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] [2025-03-08 17:41:09,253 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] [2025-03-08 17:41:09,253 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] [2025-03-08 17:41:09,254 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] [2025-03-08 17:41:09,254 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] [2025-03-08 17:41:09,254 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] [2025-03-08 17:41:09,254 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] [2025-03-08 17:41:09,254 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] [2025-03-08 17:41:09,254 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] [2025-03-08 17:41:09,254 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] [2025-03-08 17:41:09,255 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] [2025-03-08 17:41:09,255 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] [2025-03-08 17:41:09,255 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] [2025-03-08 17:41:09,255 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] [2025-03-08 17:41:09,255 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] [2025-03-08 17:41:09,255 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] [2025-03-08 17:41:09,256 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] [2025-03-08 17:41:09,256 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] [2025-03-08 17:41:09,257 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] [2025-03-08 17:41:09,257 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] [2025-03-08 17:41:09,257 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] [2025-03-08 17:41:09,257 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] [2025-03-08 17:41:09,257 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] [2025-03-08 17:41:09,258 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] [2025-03-08 17:41:09,258 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] [2025-03-08 17:41:09,258 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] [2025-03-08 17:41:09,258 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] [2025-03-08 17:41:09,259 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] [2025-03-08 17:41:09,259 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] [2025-03-08 17:41:09,259 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] [2025-03-08 17:41:09,259 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] [2025-03-08 17:41:09,260 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] [2025-03-08 17:41:09,260 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] [2025-03-08 17:41:09,260 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] [2025-03-08 17:41:09,260 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] [2025-03-08 17:41:09,261 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] [2025-03-08 17:41:09,261 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] [2025-03-08 17:41:09,261 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] [2025-03-08 17:41:09,262 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] [2025-03-08 17:41:09,262 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] [2025-03-08 17:41:09,262 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] [2025-03-08 17:41:09,262 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] [2025-03-08 17:41:09,263 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] [2025-03-08 17:41:09,263 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] [2025-03-08 17:41:09,263 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] [2025-03-08 17:41:09,263 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] [2025-03-08 17:41:09,264 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] [2025-03-08 17:41:09,264 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] [2025-03-08 17:41:09,264 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] [2025-03-08 17:41:09,264 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] [2025-03-08 17:41:09,265 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] [2025-03-08 17:41:09,265 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] [2025-03-08 17:41:09,265 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] [2025-03-08 17:41:09,265 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] [2025-03-08 17:41:09,266 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] [2025-03-08 17:41:09,266 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] [2025-03-08 17:41:09,266 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] [2025-03-08 17:41:09,266 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] [2025-03-08 17:41:09,267 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] [2025-03-08 17:41:09,267 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] [2025-03-08 17:41:09,267 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] [2025-03-08 17:41:09,267 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] [2025-03-08 17:41:09,268 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] [2025-03-08 17:41:09,268 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] [2025-03-08 17:41:09,268 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] [2025-03-08 17:41:09,268 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] [2025-03-08 17:41:09,269 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] [2025-03-08 17:41:09,269 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] [2025-03-08 17:41:09,269 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] [2025-03-08 17:41:09,269 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] [2025-03-08 17:41:09,270 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] [2025-03-08 17:41:09,270 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] [2025-03-08 17:41:09,270 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] [2025-03-08 17:41:09,270 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] [2025-03-08 17:41:09,271 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] [2025-03-08 17:41:09,271 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] [2025-03-08 17:41:09,271 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] [2025-03-08 17:41:09,271 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] [2025-03-08 17:41:09,271 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] [2025-03-08 17:41:09,272 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] [2025-03-08 17:41:09,272 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] [2025-03-08 17:41:09,272 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] [2025-03-08 17:41:09,272 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] [2025-03-08 17:41:09,272 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] [2025-03-08 17:41:09,273 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] [2025-03-08 17:41:09,273 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] [2025-03-08 17:41:09,273 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] [2025-03-08 17:41:09,312 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/rec_ticketlock.i[172521,172534] [2025-03-08 17:41:09,314 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/rec_ticketlock.i[172881,172894] [2025-03-08 17:41:09,322 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/rec_ticketlock.i[195820,195833] [2025-03-08 17:41:09,323 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/rec_ticketlock.i[195887,195900] [2025-03-08 17:41:09,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:41:09,555 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:41:09,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:09 WrapperNode [2025-03-08 17:41:09,555 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:41:09,556 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:41:09,556 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:41:09,556 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:41:09,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:09" (1/1) ... [2025-03-08 17:41:09,616 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:09" (1/1) ... [2025-03-08 17:41:09,654 INFO L138 Inliner]: procedures = 923, calls = 945, calls flagged for inlining = 834, calls inlined = 53, statements flattened = 469 [2025-03-08 17:41:09,658 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:41:09,658 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:41:09,658 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:41:09,658 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:41:09,664 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:09" (1/1) ... [2025-03-08 17:41:09,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:09" (1/1) ... [2025-03-08 17:41:09,667 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:09" (1/1) ... [2025-03-08 17:41:09,691 INFO L175 MemorySlicer]: Split 28 memory accesses to 3 slices as follows [2, 24, 2]. 86 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4, 0]. The 10 writes are split as follows [0, 9, 1]. [2025-03-08 17:41:09,692 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:09" (1/1) ... [2025-03-08 17:41:09,692 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:09" (1/1) ... [2025-03-08 17:41:09,698 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:09" (1/1) ... [2025-03-08 17:41:09,700 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:09" (1/1) ... [2025-03-08 17:41:09,701 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:09" (1/1) ... [2025-03-08 17:41:09,706 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:09" (1/1) ... [2025-03-08 17:41:09,708 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:41:09,712 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:41:09,712 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:41:09,712 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:41:09,713 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:09" (1/1) ... [2025-03-08 17:41:09,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:41:09,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:41:09,739 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 17:41:09,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 17:41:09,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 17:41:09,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 17:41:09,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 17:41:09,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:41:09,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:41:09,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:41:09,760 INFO L130 BoogieDeclarations]: Found specification of procedure run [2025-03-08 17:41:09,760 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2025-03-08 17:41:09,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 17:41:09,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 17:41:09,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 17:41:09,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 17:41:09,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 17:41:09,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:41:09,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 17:41:09,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 17:41:09,762 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 17:41:09,871 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:41:09,872 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:41:10,237 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885: havoc vatomic32_read_rlx_#t~ret112#1; [2025-03-08 17:41:10,237 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-9: havoc vatomic32_read_rlx_#t~ret112#1; [2025-03-08 17:41:10,238 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-18: havoc vatomic32_read_rlx_#t~ret112#1; [2025-03-08 17:41:10,238 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1920: havoc vatomic32_cmpxchg_rlx_#t~ret117#1; [2025-03-08 17:41:10,238 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2285: havoc vatomic32_await_eq_acq_#t~ret174#1; [2025-03-08 17:41:10,238 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1890: havoc vatomic32_read_acq_#t~ret113#1; [2025-03-08 17:41:10,238 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4516: havoc vatomic32_get_inc_#t~ret577#1; [2025-03-08 17:41:10,238 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2115: havoc vatomic32_get_inc_rlx_#t~ret156#1; [2025-03-08 17:41:10,283 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6013: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-03-08 17:41:10,283 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6013-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-03-08 17:41:10,284 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 17:41:10,285 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:41:10,478 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:41:10,478 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:41:10,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:41:10 BoogieIcfgContainer [2025-03-08 17:41:10,478 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:41:10,502 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:41:10,502 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:41:10,505 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:41:10,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:41:07" (1/3) ... [2025-03-08 17:41:10,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68cea6ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:41:10, skipping insertion in model container [2025-03-08 17:41:10,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:09" (2/3) ... [2025-03-08 17:41:10,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68cea6ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:41:10, skipping insertion in model container [2025-03-08 17:41:10,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:41:10" (3/3) ... [2025-03-08 17:41:10,508 INFO L128 eAbstractionObserver]: Analyzing ICFG rec_ticketlock.i [2025-03-08 17:41:10,518 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:41:10,519 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rec_ticketlock.i that has 2 procedures, 111 locations, 1 initial locations, 22 loop locations, and 4 error locations. [2025-03-08 17:41:10,519 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 17:41:10,605 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-08 17:41:10,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 190 transitions, 387 flow [2025-03-08 17:41:10,680 INFO L124 PetriNetUnfolderBase]: 90/218 cut-off events. [2025-03-08 17:41:10,683 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 17:41:10,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 218 events. 90/218 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 589 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 176. Up to 8 conditions per place. [2025-03-08 17:41:10,692 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 190 transitions, 387 flow [2025-03-08 17:41:10,697 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 190 transitions, 387 flow [2025-03-08 17:41:10,706 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:41:10,716 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;@12fc86dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:41:10,717 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-08 17:41:10,728 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:41:10,729 INFO L124 PetriNetUnfolderBase]: 23/50 cut-off events. [2025-03-08 17:41:10,729 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 17:41:10,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:41:10,730 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-08 17:41:10,730 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 17:41:10,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:41:10,735 INFO L85 PathProgramCache]: Analyzing trace with hash -2113648572, now seen corresponding path program 1 times [2025-03-08 17:41:10,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:41:10,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033423507] [2025-03-08 17:41:10,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:41:10,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:41:10,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 17:41:10,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 17:41:10,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:41:10,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:41:10,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:41:10,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:41:10,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033423507] [2025-03-08 17:41:10,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033423507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:41:10,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:41:10,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:41:10,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455717227] [2025-03-08 17:41:10,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:41:10,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 17:41:10,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:41:10,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 17:41:10,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 17:41:10,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 190 [2025-03-08 17:41:10,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 190 transitions, 387 flow. Second operand has 2 states, 2 states have (on average 41.0) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:41:10,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:41:10,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 190 [2025-03-08 17:41:10,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:41:11,186 INFO L124 PetriNetUnfolderBase]: 598/1424 cut-off events. [2025-03-08 17:41:11,187 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 17:41:11,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2588 conditions, 1424 events. 598/1424 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 8558 event pairs, 480 based on Foata normal form. 688/1846 useless extension candidates. Maximal degree in co-relation 2543. Up to 1159 conditions per place. [2025-03-08 17:41:11,194 INFO L140 encePairwiseOnDemand]: 125/190 looper letters, 87 selfloop transitions, 0 changer transitions 0/125 dead transitions. [2025-03-08 17:41:11,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 125 transitions, 431 flow [2025-03-08 17:41:11,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 17:41:11,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-08 17:41:11,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 228 transitions. [2025-03-08 17:41:11,203 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-08 17:41:11,204 INFO L175 Difference]: Start difference. First operand has 114 places, 190 transitions, 387 flow. Second operand 2 states and 228 transitions. [2025-03-08 17:41:11,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 125 transitions, 431 flow [2025-03-08 17:41:11,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 125 transitions, 431 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 17:41:11,210 INFO L231 Difference]: Finished difference. Result has 115 places, 125 transitions, 257 flow [2025-03-08 17:41:11,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=257, PETRI_PLACES=115, PETRI_TRANSITIONS=125} [2025-03-08 17:41:11,214 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 1 predicate places. [2025-03-08 17:41:11,214 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 125 transitions, 257 flow [2025-03-08 17:41:11,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 41.0) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:41:11,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:41:11,215 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:41:11,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:41:11,215 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 17:41:11,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:41:11,215 INFO L85 PathProgramCache]: Analyzing trace with hash 2014563857, now seen corresponding path program 1 times [2025-03-08 17:41:11,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:41:11,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409622984] [2025-03-08 17:41:11,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:41:11,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:41:11,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 17:41:11,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 17:41:11,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:41:11,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:41:11,252 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 17:41:11,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 17:41:11,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 17:41:11,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:41:11,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:41:11,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 17:41:11,297 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 17:41:11,298 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-03-08 17:41:11,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-03-08 17:41:11,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2025-03-08 17:41:11,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2025-03-08 17:41:11,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-03-08 17:41:11,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-03-08 17:41:11,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-03-08 17:41:11,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:41:11,302 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 17:41:11,304 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 17:41:11,304 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-08 17:41:11,431 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-08 17:41:11,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 202 places, 339 transitions, 694 flow [2025-03-08 17:41:11,482 INFO L124 PetriNetUnfolderBase]: 171/417 cut-off events. [2025-03-08 17:41:11,485 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-08 17:41:11,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429 conditions, 417 events. 171/417 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1572 event pairs, 0 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 343. Up to 12 conditions per place. [2025-03-08 17:41:11,489 INFO L82 GeneralOperation]: Start removeDead. Operand has 202 places, 339 transitions, 694 flow [2025-03-08 17:41:11,496 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 202 places, 339 transitions, 694 flow [2025-03-08 17:41:11,497 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:41:11,497 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;@12fc86dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:41:11,497 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-08 17:41:11,501 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:41:11,501 INFO L124 PetriNetUnfolderBase]: 23/52 cut-off events. [2025-03-08 17:41:11,501 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 17:41:11,501 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:41:11,501 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:41:11,501 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-08 17:41:11,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:41:11,501 INFO L85 PathProgramCache]: Analyzing trace with hash -148058773, now seen corresponding path program 1 times [2025-03-08 17:41:11,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:41:11,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071224480] [2025-03-08 17:41:11,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:41:11,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:41:11,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 17:41:11,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 17:41:11,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:41:11,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:41:11,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:41:11,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:41:11,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071224480] [2025-03-08 17:41:11,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071224480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:41:11,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:41:11,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:41:11,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339534565] [2025-03-08 17:41:11,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:41:11,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 17:41:11,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:41:11,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 17:41:11,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 17:41:11,535 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 339 [2025-03-08 17:41:11,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 339 transitions, 694 flow. Second operand has 2 states, 2 states have (on average 66.5) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:41:11,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:41:11,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 339 [2025-03-08 17:41:11,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:41:18,940 INFO L124 PetriNetUnfolderBase]: 77592/123491 cut-off events. [2025-03-08 17:41:18,940 INFO L125 PetriNetUnfolderBase]: For 529/529 co-relation queries the response was YES. [2025-03-08 17:41:19,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235811 conditions, 123491 events. 77592/123491 cut-off events. For 529/529 co-relation queries the response was YES. Maximal size of possible extension queue 3041. Compared 1061995 event pairs, 63060 based on Foata normal form. 54704/155511 useless extension candidates. Maximal degree in co-relation 221581. Up to 112008 conditions per place. [2025-03-08 17:41:19,594 INFO L140 encePairwiseOnDemand]: 225/339 looper letters, 162 selfloop transitions, 0 changer transitions 0/225 dead transitions. [2025-03-08 17:41:19,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 225 transitions, 790 flow [2025-03-08 17:41:19,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 17:41:19,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-08 17:41:19,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 402 transitions. [2025-03-08 17:41:19,596 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5929203539823009 [2025-03-08 17:41:19,596 INFO L175 Difference]: Start difference. First operand has 202 places, 339 transitions, 694 flow. Second operand 2 states and 402 transitions. [2025-03-08 17:41:19,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 225 transitions, 790 flow [2025-03-08 17:41:19,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 225 transitions, 790 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 17:41:19,600 INFO L231 Difference]: Finished difference. Result has 203 places, 225 transitions, 466 flow [2025-03-08 17:41:19,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=466, PETRI_PLACES=203, PETRI_TRANSITIONS=225} [2025-03-08 17:41:19,601 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 1 predicate places. [2025-03-08 17:41:19,601 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 225 transitions, 466 flow [2025-03-08 17:41:19,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 66.5) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:41:19,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:41:19,601 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:41:19,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:41:19,602 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-08 17:41:19,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:41:19,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1354802191, now seen corresponding path program 1 times [2025-03-08 17:41:19,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:41:19,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144033789] [2025-03-08 17:41:19,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:41:19,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:41:19,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 17:41:19,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 17:41:19,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:41:19,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:41:19,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:41:19,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:41:19,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144033789] [2025-03-08 17:41:19,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144033789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:41:19,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:41:19,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:41:19,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655706855] [2025-03-08 17:41:19,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:41:19,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:41:19,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:41:19,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:41:19,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:41:19,687 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 339 [2025-03-08 17:41:19,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 225 transitions, 466 flow. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:41:19,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:41:19,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 339 [2025-03-08 17:41:19,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:41:27,212 INFO L124 PetriNetUnfolderBase]: 77591/123646 cut-off events. [2025-03-08 17:41:27,212 INFO L125 PetriNetUnfolderBase]: For 527/527 co-relation queries the response was YES. [2025-03-08 17:41:27,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235964 conditions, 123646 events. 77591/123646 cut-off events. For 527/527 co-relation queries the response was YES. Maximal size of possible extension queue 3044. Compared 1064423 event pairs, 61886 based on Foata normal form. 0/100906 useless extension candidates. Maximal degree in co-relation 235959. Up to 111929 conditions per place. [2025-03-08 17:41:27,735 INFO L140 encePairwiseOnDemand]: 336/339 looper letters, 235 selfloop transitions, 2 changer transitions 0/300 dead transitions. [2025-03-08 17:41:27,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 300 transitions, 1090 flow [2025-03-08 17:41:27,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:41:27,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:41:27,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2025-03-08 17:41:27,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4198623402163225 [2025-03-08 17:41:27,737 INFO L175 Difference]: Start difference. First operand has 203 places, 225 transitions, 466 flow. Second operand 3 states and 427 transitions. [2025-03-08 17:41:27,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 300 transitions, 1090 flow [2025-03-08 17:41:27,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 300 transitions, 1090 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 17:41:27,750 INFO L231 Difference]: Finished difference. Result has 206 places, 226 transitions, 478 flow [2025-03-08 17:41:27,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=478, PETRI_PLACES=206, PETRI_TRANSITIONS=226} [2025-03-08 17:41:27,751 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 4 predicate places. [2025-03-08 17:41:27,752 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 226 transitions, 478 flow [2025-03-08 17:41:27,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:41:27,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:41:27,752 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:41:27,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:41:27,753 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-08 17:41:27,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:41:27,753 INFO L85 PathProgramCache]: Analyzing trace with hash -510898478, now seen corresponding path program 1 times [2025-03-08 17:41:27,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:41:27,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034408021] [2025-03-08 17:41:27,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:41:27,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:41:27,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 17:41:27,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 17:41:27,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:41:27,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:41:27,795 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 17:41:27,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 17:41:27,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 17:41:27,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:41:27,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:41:27,842 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 17:41:27,845 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 17:41:27,845 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-03-08 17:41:27,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2025-03-08 17:41:27,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2025-03-08 17:41:27,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 9 remaining) [2025-03-08 17:41:27,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 9 remaining) [2025-03-08 17:41:27,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 9 remaining) [2025-03-08 17:41:27,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 9 remaining) [2025-03-08 17:41:27,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2025-03-08 17:41:27,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2025-03-08 17:41:27,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 17:41:27,846 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 17:41:27,847 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 17:41:27,847 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-08 17:41:27,971 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-08 17:41:27,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 290 places, 488 transitions, 1003 flow [2025-03-08 17:41:28,041 INFO L124 PetriNetUnfolderBase]: 267/657 cut-off events. [2025-03-08 17:41:28,042 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-08 17:41:28,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 682 conditions, 657 events. 267/657 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2987 event pairs, 1 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 532. Up to 24 conditions per place. [2025-03-08 17:41:28,052 INFO L82 GeneralOperation]: Start removeDead. Operand has 290 places, 488 transitions, 1003 flow [2025-03-08 17:41:28,065 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 290 places, 488 transitions, 1003 flow [2025-03-08 17:41:28,067 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:41:28,068 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;@12fc86dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:41:28,068 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-08 17:41:28,071 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:41:28,071 INFO L124 PetriNetUnfolderBase]: 23/52 cut-off events. [2025-03-08 17:41:28,071 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 17:41:28,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:41:28,071 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:41:28,071 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-08 17:41:28,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:41:28,074 INFO L85 PathProgramCache]: Analyzing trace with hash -767698093, now seen corresponding path program 1 times [2025-03-08 17:41:28,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:41:28,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473900563] [2025-03-08 17:41:28,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:41:28,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:41:28,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 17:41:28,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 17:41:28,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:41:28,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:41:28,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:41:28,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:41:28,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473900563] [2025-03-08 17:41:28,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473900563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:41:28,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:41:28,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:41:28,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607132208] [2025-03-08 17:41:28,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:41:28,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 17:41:28,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:41:28,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 17:41:28,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 17:41:28,099 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 488 [2025-03-08 17:41:28,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 488 transitions, 1003 flow. Second operand has 2 states, 2 states have (on average 91.5) internal successors, (183), 2 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:41:28,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:41:28,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 488 [2025-03-08 17:41:28,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand