./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/libvsync/hclhlock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/libvsync/hclhlock.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 b0a2798ee53cc94366daea227ae4e14ebe705512ec93088d5efc9992b9f84ae5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:29:44,695 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:29:44,748 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:29:44,757 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:29:44,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:29:44,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:29:44,778 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:29:44,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:29:44,779 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:29:44,779 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:29:44,779 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:29:44,779 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:29:44,779 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:29:44,779 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:29:44,779 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:29:44,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:29:44,780 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:29:44,780 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:29:44,781 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:29:44,781 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:29:44,781 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:29:44,781 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:29:44,781 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:29:44,781 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:29:44,781 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:29:44,781 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:29:44,781 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:29:44,781 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:29:44,781 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:29:44,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:29:44,782 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:29:44,782 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:29:44,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:29:44,782 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:29:44,782 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:29:44,782 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:29:44,782 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:29:44,782 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:29:44,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:29:44,782 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:29:44,782 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:29:44,782 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:29:44,782 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:29:44,782 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 -> b0a2798ee53cc94366daea227ae4e14ebe705512ec93088d5efc9992b9f84ae5 [2025-03-04 02:29:44,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:29:44,996 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:29:44,997 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:29:44,998 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:29:44,998 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:29:45,000 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/hclhlock.i [2025-03-04 02:29:46,099 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3260d52d8/7f4cbc777ea94c51b06eab6894aa9e06/FLAG713a5fdca [2025-03-04 02:29:46,497 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:29:46,498 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i [2025-03-04 02:29:46,539 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3260d52d8/7f4cbc777ea94c51b06eab6894aa9e06/FLAG713a5fdca [2025-03-04 02:29:46,643 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3260d52d8/7f4cbc777ea94c51b06eab6894aa9e06 [2025-03-04 02:29:46,645 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:29:46,647 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:29:46,648 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:29:46,648 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:29:46,650 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:29:46,651 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:29:46" (1/1) ... [2025-03-04 02:29:46,651 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b355228 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:46, skipping insertion in model container [2025-03-04 02:29:46,651 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:29:46" (1/1) ... [2025-03-04 02:29:46,721 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:29:47,977 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/hclhlock.i[172094,172107] [2025-03-04 02:29:47,978 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/hclhlock.i[172145,172158] [2025-03-04 02:29:47,978 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/hclhlock.i[172202,172215] [2025-03-04 02:29:47,983 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/hclhlock.i[172763,172776] [2025-03-04 02:29:47,983 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/hclhlock.i[172814,172827] [2025-03-04 02:29:47,989 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/hclhlock.i[174060,174073] [2025-03-04 02:29:47,989 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/hclhlock.i[174118,174131] [2025-03-04 02:29:47,990 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/hclhlock.i[174622,174635] [2025-03-04 02:29:47,990 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/hclhlock.i[174679,174692] [2025-03-04 02:29:47,991 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/hclhlock.i[174746,174759] [2025-03-04 02:29:47,991 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/hclhlock.i[175274,175287] [2025-03-04 02:29:47,992 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/hclhlock.i[175341,175354] [2025-03-04 02:29:47,993 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/hclhlock.i[175944,175957] [2025-03-04 02:29:48,149 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/hclhlock.i[198494,198507] [2025-03-04 02:29:48,150 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/hclhlock.i[198561,198574] [2025-03-04 02:29:48,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:29:48,165 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:29:48,221 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] [2025-03-04 02:29:48,222 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] [2025-03-04 02:29:48,222 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] [2025-03-04 02:29:48,223 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] [2025-03-04 02:29:48,224 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] [2025-03-04 02:29:48,224 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] [2025-03-04 02:29:48,224 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] [2025-03-04 02:29:48,224 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] [2025-03-04 02:29:48,224 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] [2025-03-04 02:29:48,225 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] [2025-03-04 02:29:48,225 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] [2025-03-04 02:29:48,225 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] [2025-03-04 02:29:48,225 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] [2025-03-04 02:29:48,226 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] [2025-03-04 02:29:48,226 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] [2025-03-04 02:29:48,226 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] [2025-03-04 02:29:48,226 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] [2025-03-04 02:29:48,226 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] [2025-03-04 02:29:48,227 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] [2025-03-04 02:29:48,227 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] [2025-03-04 02:29:48,227 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] [2025-03-04 02:29:48,227 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] [2025-03-04 02:29:48,227 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] [2025-03-04 02:29:48,227 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] [2025-03-04 02:29:48,228 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] [2025-03-04 02:29:48,228 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] [2025-03-04 02:29:48,228 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] [2025-03-04 02:29:48,228 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] [2025-03-04 02:29:48,228 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] [2025-03-04 02:29:48,229 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] [2025-03-04 02:29:48,229 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] [2025-03-04 02:29:48,229 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] [2025-03-04 02:29:48,229 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] [2025-03-04 02:29:48,230 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] [2025-03-04 02:29:48,230 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] [2025-03-04 02:29:48,230 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] [2025-03-04 02:29:48,230 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] [2025-03-04 02:29:48,231 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] [2025-03-04 02:29:48,231 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] [2025-03-04 02:29:48,231 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] [2025-03-04 02:29:48,231 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] [2025-03-04 02:29:48,232 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] [2025-03-04 02:29:48,232 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] [2025-03-04 02:29:48,232 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] [2025-03-04 02:29:48,232 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] [2025-03-04 02:29:48,233 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] [2025-03-04 02:29:48,233 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] [2025-03-04 02:29:48,233 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] [2025-03-04 02:29:48,233 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] [2025-03-04 02:29:48,234 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] [2025-03-04 02:29:48,234 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] [2025-03-04 02:29:48,234 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] [2025-03-04 02:29:48,234 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] [2025-03-04 02:29:48,235 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] [2025-03-04 02:29:48,235 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] [2025-03-04 02:29:48,235 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] [2025-03-04 02:29:48,235 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] [2025-03-04 02:29:48,236 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] [2025-03-04 02:29:48,236 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] [2025-03-04 02:29:48,236 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] [2025-03-04 02:29:48,236 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] [2025-03-04 02:29:48,237 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] [2025-03-04 02:29:48,237 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] [2025-03-04 02:29:48,237 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] [2025-03-04 02:29:48,238 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] [2025-03-04 02:29:48,238 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] [2025-03-04 02:29:48,239 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] [2025-03-04 02:29:48,239 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] [2025-03-04 02:29:48,239 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] [2025-03-04 02:29:48,239 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] [2025-03-04 02:29:48,239 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] [2025-03-04 02:29:48,240 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] [2025-03-04 02:29:48,240 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] [2025-03-04 02:29:48,240 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] [2025-03-04 02:29:48,240 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] [2025-03-04 02:29:48,240 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] [2025-03-04 02:29:48,240 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] [2025-03-04 02:29:48,241 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] [2025-03-04 02:29:48,241 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] [2025-03-04 02:29:48,241 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] [2025-03-04 02:29:48,241 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] [2025-03-04 02:29:48,242 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] [2025-03-04 02:29:48,242 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] [2025-03-04 02:29:48,242 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] [2025-03-04 02:29:48,243 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] [2025-03-04 02:29:48,243 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] [2025-03-04 02:29:48,243 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] [2025-03-04 02:29:48,243 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] [2025-03-04 02:29:48,244 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] [2025-03-04 02:29:48,244 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] [2025-03-04 02:29:48,244 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] [2025-03-04 02:29:48,244 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] [2025-03-04 02:29:48,244 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] [2025-03-04 02:29:48,245 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] [2025-03-04 02:29:48,245 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] [2025-03-04 02:29:48,245 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] [2025-03-04 02:29:48,245 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] [2025-03-04 02:29:48,246 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] [2025-03-04 02:29:48,246 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] [2025-03-04 02:29:48,246 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] [2025-03-04 02:29:48,271 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/hclhlock.i[172094,172107] [2025-03-04 02:29:48,272 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/hclhlock.i[172145,172158] [2025-03-04 02:29:48,272 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/hclhlock.i[172202,172215] [2025-03-04 02:29:48,272 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/hclhlock.i[172763,172776] [2025-03-04 02:29:48,273 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/hclhlock.i[172814,172827] [2025-03-04 02:29:48,274 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/hclhlock.i[174060,174073] [2025-03-04 02:29:48,274 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/hclhlock.i[174118,174131] [2025-03-04 02:29:48,275 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/hclhlock.i[174622,174635] [2025-03-04 02:29:48,275 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/hclhlock.i[174679,174692] [2025-03-04 02:29:48,275 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/hclhlock.i[174746,174759] [2025-03-04 02:29:48,276 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/hclhlock.i[175274,175287] [2025-03-04 02:29:48,276 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/hclhlock.i[175341,175354] [2025-03-04 02:29:48,280 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/hclhlock.i[175944,175957] [2025-03-04 02:29:48,285 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/hclhlock.i[198494,198507] [2025-03-04 02:29:48,285 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/hclhlock.i[198561,198574] [2025-03-04 02:29:48,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:29:48,474 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:29:48,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:48 WrapperNode [2025-03-04 02:29:48,475 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:29:48,476 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:29:48,476 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:29:48,476 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:29:48,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:48" (1/1) ... [2025-03-04 02:29:48,526 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:48" (1/1) ... [2025-03-04 02:29:48,560 INFO L138 Inliner]: procedures = 921, calls = 957, calls flagged for inlining = 833, calls inlined = 67, statements flattened = 799 [2025-03-04 02:29:48,561 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:29:48,561 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:29:48,561 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:29:48,561 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:29:48,568 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:48" (1/1) ... [2025-03-04 02:29:48,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:48" (1/1) ... [2025-03-04 02:29:48,571 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:48" (1/1) ... [2025-03-04 02:29:48,596 INFO L175 MemorySlicer]: Split 50 memory accesses to 4 slices as follows [2, 28, 18, 2]. 56 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 7, 6, 0]. The 15 writes are split as follows [0, 9, 5, 1]. [2025-03-04 02:29:48,597 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:48" (1/1) ... [2025-03-04 02:29:48,597 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:48" (1/1) ... [2025-03-04 02:29:48,609 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:48" (1/1) ... [2025-03-04 02:29:48,611 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:48" (1/1) ... [2025-03-04 02:29:48,612 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:48" (1/1) ... [2025-03-04 02:29:48,614 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:48" (1/1) ... [2025-03-04 02:29:48,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:29:48,621 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:29:48,621 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:29:48,621 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:29:48,622 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:48" (1/1) ... [2025-03-04 02:29:48,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:29:48,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:48,645 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:29:48,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:29:48,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:29:48,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:29:48,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 02:29:48,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 02:29:48,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:29:48,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 02:29:48,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 02:29:48,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 02:29:48,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 02:29:48,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:29:48,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:29:48,663 INFO L130 BoogieDeclarations]: Found specification of procedure run [2025-03-04 02:29:48,663 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2025-03-04 02:29:48,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 02:29:48,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 02:29:48,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 02:29:48,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 02:29:48,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 02:29:48,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:29:48,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:29:48,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 02:29:48,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 02:29:48,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 02:29:48,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 02:29:48,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 02:29:48,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 02:29:48,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 02:29:48,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:29:48,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:29:48,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 02:29:48,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 02:29:48,665 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:29:48,813 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:29:48,815 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:29:49,475 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885: havoc vatomic32_read_rlx_#t~ret112#1; [2025-03-04 02:29:49,475 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-9: havoc vatomic32_read_rlx_#t~ret112#1; [2025-03-04 02:29:49,475 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-18: havoc vatomic32_read_rlx_#t~ret112#1; [2025-03-04 02:29:49,475 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-27: havoc vatomic32_read_rlx_#t~ret112#1; [2025-03-04 02:29:49,475 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1920: havoc vatomic32_cmpxchg_rlx_#t~ret117#1; [2025-03-04 02:29:49,475 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1890: havoc vatomic32_read_acq_#t~ret113#1; [2025-03-04 02:29:49,475 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1890-9: havoc vatomic32_read_acq_#t~ret113#1; [2025-03-04 02:29:49,475 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2290: havoc vatomic32_await_neq_acq_#t~ret175#1; [2025-03-04 02:29:49,475 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2290-9: havoc vatomic32_await_neq_acq_#t~ret175#1; [2025-03-04 02:29:49,475 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3660: havoc vatomicptr_read_acq_#t~ret413#1.base, vatomicptr_read_acq_#t~ret413#1.offset; [2025-03-04 02:29:49,621 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6115: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-03-04 02:29:49,621 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6115-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-03-04 02:29:49,622 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:29:49,622 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:29:49,921 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:29:49,921 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:29:49,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:29:49 BoogieIcfgContainer [2025-03-04 02:29:49,922 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:29:49,923 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:29:49,923 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:29:49,926 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:29:49,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:29:46" (1/3) ... [2025-03-04 02:29:49,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60aa4cf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:29:49, skipping insertion in model container [2025-03-04 02:29:49,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:48" (2/3) ... [2025-03-04 02:29:49,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60aa4cf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:29:49, skipping insertion in model container [2025-03-04 02:29:49,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:29:49" (3/3) ... [2025-03-04 02:29:49,928 INFO L128 eAbstractionObserver]: Analyzing ICFG hclhlock.i [2025-03-04 02:29:49,943 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:29:49,944 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hclhlock.i that has 2 procedures, 225 locations, 1 initial locations, 42 loop locations, and 17 error locations. [2025-03-04 02:29:49,944 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:29:50,075 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 02:29:50,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 228 places, 365 transitions, 737 flow [2025-03-04 02:29:50,186 INFO L124 PetriNetUnfolderBase]: 151/393 cut-off events. [2025-03-04 02:29:50,188 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 02:29:50,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 398 conditions, 393 events. 151/393 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1127 event pairs, 0 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 298. Up to 8 conditions per place. [2025-03-04 02:29:50,197 INFO L82 GeneralOperation]: Start removeDead. Operand has 228 places, 365 transitions, 737 flow [2025-03-04 02:29:50,206 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 228 places, 365 transitions, 737 flow [2025-03-04 02:29:50,215 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:29:50,225 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;@551d6f11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:29:50,225 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-03-04 02:29:50,233 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:29:50,233 INFO L124 PetriNetUnfolderBase]: 9/25 cut-off events. [2025-03-04 02:29:50,233 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:29:50,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:50,234 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:50,234 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-04 02:29:50,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:50,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1020487280, now seen corresponding path program 1 times [2025-03-04 02:29:50,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:50,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525410289] [2025-03-04 02:29:50,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:29:50,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:50,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 02:29:50,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 02:29:50,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:50,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:50,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:29:50,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:50,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525410289] [2025-03-04 02:29:50,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525410289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:29:50,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:29:50,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:29:50,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850669650] [2025-03-04 02:29:50,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:29:50,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:29:50,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:50,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:29:50,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:29:50,582 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 365 [2025-03-04 02:29:50,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 365 transitions, 737 flow. Second operand has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:50,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:50,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 365 [2025-03-04 02:29:50,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:51,109 INFO L124 PetriNetUnfolderBase]: 945/2518 cut-off events. [2025-03-04 02:29:51,109 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 02:29:51,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4251 conditions, 2518 events. 945/2518 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 16344 event pairs, 696 based on Foata normal form. 1159/3271 useless extension candidates. Maximal degree in co-relation 4147. Up to 1717 conditions per place. [2025-03-04 02:29:51,125 INFO L140 encePairwiseOnDemand]: 255/365 looper letters, 141 selfloop transitions, 3 changer transitions 0/256 dead transitions. [2025-03-04 02:29:51,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 256 transitions, 807 flow [2025-03-04 02:29:51,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:29:51,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:29:51,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 703 transitions. [2025-03-04 02:29:51,139 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4815068493150685 [2025-03-04 02:29:51,141 INFO L175 Difference]: Start difference. First operand has 228 places, 365 transitions, 737 flow. Second operand 4 states and 703 transitions. [2025-03-04 02:29:51,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 256 transitions, 807 flow [2025-03-04 02:29:51,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 256 transitions, 807 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:29:51,151 INFO L231 Difference]: Finished difference. Result has 229 places, 256 transitions, 525 flow [2025-03-04 02:29:51,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=525, PETRI_PLACES=229, PETRI_TRANSITIONS=256} [2025-03-04 02:29:51,155 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, 1 predicate places. [2025-03-04 02:29:51,155 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 256 transitions, 525 flow [2025-03-04 02:29:51,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:51,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:51,155 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:51,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:29:51,156 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-04 02:29:51,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:51,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1435631057, now seen corresponding path program 1 times [2025-03-04 02:29:51,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:51,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948277933] [2025-03-04 02:29:51,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:29:51,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:51,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 02:29:51,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 02:29:51,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:51,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:51,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:29:51,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:51,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948277933] [2025-03-04 02:29:51,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948277933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:29:51,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:29:51,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:29:51,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435055380] [2025-03-04 02:29:51,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:29:51,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:29:51,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:51,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:29:51,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:29:51,274 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 365 [2025-03-04 02:29:51,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 256 transitions, 525 flow. Second operand has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:51,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:51,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 365 [2025-03-04 02:29:51,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:51,664 INFO L124 PetriNetUnfolderBase]: 945/2516 cut-off events. [2025-03-04 02:29:51,664 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 02:29:51,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4253 conditions, 2516 events. 945/2516 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 16359 event pairs, 696 based on Foata normal form. 1/2113 useless extension candidates. Maximal degree in co-relation 4206. Up to 1717 conditions per place. [2025-03-04 02:29:51,673 INFO L140 encePairwiseOnDemand]: 361/365 looper letters, 141 selfloop transitions, 3 changer transitions 0/254 dead transitions. [2025-03-04 02:29:51,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 254 transitions, 809 flow [2025-03-04 02:29:51,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:29:51,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:29:51,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 597 transitions. [2025-03-04 02:29:51,676 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4089041095890411 [2025-03-04 02:29:51,676 INFO L175 Difference]: Start difference. First operand has 229 places, 256 transitions, 525 flow. Second operand 4 states and 597 transitions. [2025-03-04 02:29:51,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 254 transitions, 809 flow [2025-03-04 02:29:51,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 254 transitions, 803 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 02:29:51,679 INFO L231 Difference]: Finished difference. Result has 227 places, 254 transitions, 521 flow [2025-03-04 02:29:51,680 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=521, PETRI_PLACES=227, PETRI_TRANSITIONS=254} [2025-03-04 02:29:51,680 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -1 predicate places. [2025-03-04 02:29:51,680 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 254 transitions, 521 flow [2025-03-04 02:29:51,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:51,680 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:51,681 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:51,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:29:51,681 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-04 02:29:51,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:51,681 INFO L85 PathProgramCache]: Analyzing trace with hash -956713698, now seen corresponding path program 1 times [2025-03-04 02:29:51,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:51,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514188821] [2025-03-04 02:29:51,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:29:51,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:51,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 02:29:51,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 02:29:51,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:51,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:51,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:29:51,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:51,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514188821] [2025-03-04 02:29:51,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514188821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:29:51,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:29:51,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:29:51,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332382672] [2025-03-04 02:29:51,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:29:51,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:29:51,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:51,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:29:51,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:29:51,754 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 365 [2025-03-04 02:29:51,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 254 transitions, 521 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:51,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:51,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 365 [2025-03-04 02:29:51,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:52,110 INFO L124 PetriNetUnfolderBase]: 945/2519 cut-off events. [2025-03-04 02:29:52,110 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 02:29:52,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4259 conditions, 2519 events. 945/2519 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 16350 event pairs, 696 based on Foata normal form. 0/2115 useless extension candidates. Maximal degree in co-relation 4212. Up to 1724 conditions per place. [2025-03-04 02:29:52,120 INFO L140 encePairwiseOnDemand]: 362/365 looper letters, 145 selfloop transitions, 2 changer transitions 0/257 dead transitions. [2025-03-04 02:29:52,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 257 transitions, 821 flow [2025-03-04 02:29:52,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:29:52,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:29:52,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions. [2025-03-04 02:29:52,121 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4474885844748858 [2025-03-04 02:29:52,121 INFO L175 Difference]: Start difference. First operand has 227 places, 254 transitions, 521 flow. Second operand 3 states and 490 transitions. [2025-03-04 02:29:52,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 257 transitions, 821 flow [2025-03-04 02:29:52,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 257 transitions, 815 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 02:29:52,128 INFO L231 Difference]: Finished difference. Result has 227 places, 255 transitions, 527 flow [2025-03-04 02:29:52,129 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=527, PETRI_PLACES=227, PETRI_TRANSITIONS=255} [2025-03-04 02:29:52,129 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -1 predicate places. [2025-03-04 02:29:52,130 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 255 transitions, 527 flow [2025-03-04 02:29:52,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:52,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:52,131 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:52,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:29:52,131 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-04 02:29:52,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:52,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1011647308, now seen corresponding path program 1 times [2025-03-04 02:29:52,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:52,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866124987] [2025-03-04 02:29:52,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:29:52,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:52,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 02:29:52,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:29:52,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:52,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:52,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:29:52,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:52,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866124987] [2025-03-04 02:29:52,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866124987] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:52,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146792449] [2025-03-04 02:29:52,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:29:52,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:52,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:52,257 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:29:52,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 02:29:52,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 02:29:52,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:29:52,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:52,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:52,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 02:29:52,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:52,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:29:52,455 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:29:52,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146792449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:29:52,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:29:52,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-04 02:29:52,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217417333] [2025-03-04 02:29:52,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:29:52,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:29:52,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:52,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:29:52,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:29:52,460 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 365 [2025-03-04 02:29:52,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 255 transitions, 527 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:52,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:52,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 365 [2025-03-04 02:29:52,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:52,859 INFO L124 PetriNetUnfolderBase]: 945/2517 cut-off events. [2025-03-04 02:29:52,859 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 02:29:52,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4260 conditions, 2517 events. 945/2517 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 16345 event pairs, 696 based on Foata normal form. 1/2115 useless extension candidates. Maximal degree in co-relation 4236. Up to 1721 conditions per place. [2025-03-04 02:29:52,868 INFO L140 encePairwiseOnDemand]: 362/365 looper letters, 143 selfloop transitions, 2 changer transitions 0/253 dead transitions. [2025-03-04 02:29:52,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 253 transitions, 813 flow [2025-03-04 02:29:52,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:29:52,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:29:52,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2025-03-04 02:29:52,872 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4420091324200913 [2025-03-04 02:29:52,872 INFO L175 Difference]: Start difference. First operand has 227 places, 255 transitions, 527 flow. Second operand 3 states and 484 transitions. [2025-03-04 02:29:52,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 253 transitions, 813 flow [2025-03-04 02:29:52,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 253 transitions, 811 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:29:52,877 INFO L231 Difference]: Finished difference. Result has 226 places, 253 transitions, 525 flow [2025-03-04 02:29:52,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=521, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=525, PETRI_PLACES=226, PETRI_TRANSITIONS=253} [2025-03-04 02:29:52,878 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -2 predicate places. [2025-03-04 02:29:52,879 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 253 transitions, 525 flow [2025-03-04 02:29:52,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:52,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:52,880 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:52,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 02:29:53,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:53,081 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-04 02:29:53,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:53,081 INFO L85 PathProgramCache]: Analyzing trace with hash -876595907, now seen corresponding path program 1 times [2025-03-04 02:29:53,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:53,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151125131] [2025-03-04 02:29:53,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:29:53,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:53,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:29:53,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:29:53,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:53,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:53,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:29:53,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:53,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151125131] [2025-03-04 02:29:53,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151125131] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:53,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091621685] [2025-03-04 02:29:53,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:29:53,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:53,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:53,207 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:29:53,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 02:29:53,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:29:53,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:29:53,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:53,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:53,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:29:53,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:53,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:29:53,351 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:53,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:29:53,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091621685] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:53,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:29:53,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 6 [2025-03-04 02:29:53,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539134609] [2025-03-04 02:29:53,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:29:53,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:29:53,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:53,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:29:53,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:29:53,364 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 365 [2025-03-04 02:29:53,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 253 transitions, 525 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:53,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:53,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 365 [2025-03-04 02:29:53,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:53,712 INFO L124 PetriNetUnfolderBase]: 945/2518 cut-off events. [2025-03-04 02:29:53,712 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 02:29:53,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4264 conditions, 2518 events. 945/2518 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 16233 event pairs, 696 based on Foata normal form. 1/2117 useless extension candidates. Maximal degree in co-relation 4231. Up to 1720 conditions per place. [2025-03-04 02:29:53,721 INFO L140 encePairwiseOnDemand]: 361/365 looper letters, 143 selfloop transitions, 3 changer transitions 0/254 dead transitions. [2025-03-04 02:29:53,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 254 transitions, 821 flow [2025-03-04 02:29:53,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:29:53,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:29:53,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 488 transitions. [2025-03-04 02:29:53,723 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.445662100456621 [2025-03-04 02:29:53,723 INFO L175 Difference]: Start difference. First operand has 226 places, 253 transitions, 525 flow. Second operand 3 states and 488 transitions. [2025-03-04 02:29:53,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 254 transitions, 821 flow [2025-03-04 02:29:53,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 254 transitions, 815 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:29:53,727 INFO L231 Difference]: Finished difference. Result has 228 places, 254 transitions, 539 flow [2025-03-04 02:29:53,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=521, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=539, PETRI_PLACES=228, PETRI_TRANSITIONS=254} [2025-03-04 02:29:53,728 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, 0 predicate places. [2025-03-04 02:29:53,728 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 254 transitions, 539 flow [2025-03-04 02:29:53,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:53,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:53,728 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:53,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 02:29:53,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:53,932 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-04 02:29:53,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:53,934 INFO L85 PathProgramCache]: Analyzing trace with hash 201288723, now seen corresponding path program 1 times [2025-03-04 02:29:53,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:53,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869020266] [2025-03-04 02:29:53,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:29:53,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:53,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:29:53,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:29:53,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:53,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:54,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:29:54,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:54,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869020266] [2025-03-04 02:29:54,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869020266] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:54,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779295090] [2025-03-04 02:29:54,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:29:54,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:54,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:54,004 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:29:54,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 02:29:54,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:29:54,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:29:54,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:54,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:54,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 02:29:54,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:54,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:29:54,150 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:54,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:29:54,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779295090] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:54,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:54,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 02:29:54,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782638868] [2025-03-04 02:29:54,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:54,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:29:54,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:54,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:29:54,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:29:54,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 365 [2025-03-04 02:29:54,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 254 transitions, 539 flow. Second operand has 7 states, 7 states have (on average 116.57142857142857) internal successors, (816), 7 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:54,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:54,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 365 [2025-03-04 02:29:54,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:54,582 INFO L124 PetriNetUnfolderBase]: 945/2521 cut-off events. [2025-03-04 02:29:54,583 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 02:29:54,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4277 conditions, 2521 events. 945/2521 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 16210 event pairs, 696 based on Foata normal form. 1/2120 useless extension candidates. Maximal degree in co-relation 4234. Up to 1723 conditions per place. [2025-03-04 02:29:54,591 INFO L140 encePairwiseOnDemand]: 361/365 looper letters, 146 selfloop transitions, 5 changer transitions 0/259 dead transitions. [2025-03-04 02:29:54,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 259 transitions, 853 flow [2025-03-04 02:29:54,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:29:54,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:29:54,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 721 transitions. [2025-03-04 02:29:54,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39506849315068493 [2025-03-04 02:29:54,594 INFO L175 Difference]: Start difference. First operand has 228 places, 254 transitions, 539 flow. Second operand 5 states and 721 transitions. [2025-03-04 02:29:54,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 259 transitions, 853 flow [2025-03-04 02:29:54,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 259 transitions, 847 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:29:54,597 INFO L231 Difference]: Finished difference. Result has 232 places, 256 transitions, 559 flow [2025-03-04 02:29:54,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=559, PETRI_PLACES=232, PETRI_TRANSITIONS=256} [2025-03-04 02:29:54,599 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, 4 predicate places. [2025-03-04 02:29:54,599 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 256 transitions, 559 flow [2025-03-04 02:29:54,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.57142857142857) internal successors, (816), 7 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:54,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:54,599 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:54,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 02:29:54,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:54,800 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-04 02:29:54,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:54,800 INFO L85 PathProgramCache]: Analyzing trace with hash -2132910143, now seen corresponding path program 2 times [2025-03-04 02:29:54,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:54,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720150950] [2025-03-04 02:29:54,801 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:29:54,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:54,810 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:29:54,821 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 22 statements. [2025-03-04 02:29:54,823 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:29:54,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:54,908 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 02:29:54,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:54,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720150950] [2025-03-04 02:29:54,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720150950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:29:54,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:29:54,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:29:54,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941723887] [2025-03-04 02:29:54,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:29:54,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:29:54,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:54,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:29:54,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:29:54,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 365 [2025-03-04 02:29:54,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 256 transitions, 559 flow. Second operand has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:54,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:54,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 365 [2025-03-04 02:29:54,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:55,307 INFO L124 PetriNetUnfolderBase]: 945/2519 cut-off events. [2025-03-04 02:29:55,308 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-04 02:29:55,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4284 conditions, 2519 events. 945/2519 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 16205 event pairs, 696 based on Foata normal form. 1/2118 useless extension candidates. Maximal degree in co-relation 4235. Up to 1724 conditions per place. [2025-03-04 02:29:55,321 INFO L140 encePairwiseOnDemand]: 360/365 looper letters, 143 selfloop transitions, 5 changer transitions 0/254 dead transitions. [2025-03-04 02:29:55,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 254 transitions, 851 flow [2025-03-04 02:29:55,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:29:55,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:29:55,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 593 transitions. [2025-03-04 02:29:55,324 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40616438356164386 [2025-03-04 02:29:55,324 INFO L175 Difference]: Start difference. First operand has 232 places, 256 transitions, 559 flow. Second operand 4 states and 593 transitions. [2025-03-04 02:29:55,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 254 transitions, 851 flow [2025-03-04 02:29:55,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 254 transitions, 845 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 02:29:55,329 INFO L231 Difference]: Finished difference. Result has 232 places, 254 transitions, 559 flow [2025-03-04 02:29:55,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=559, PETRI_PLACES=232, PETRI_TRANSITIONS=254} [2025-03-04 02:29:55,331 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, 4 predicate places. [2025-03-04 02:29:55,331 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 254 transitions, 559 flow [2025-03-04 02:29:55,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:55,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:55,332 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:55,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:29:55,332 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-04 02:29:55,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:55,333 INFO L85 PathProgramCache]: Analyzing trace with hash 28661859, now seen corresponding path program 1 times [2025-03-04 02:29:55,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:55,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474791687] [2025-03-04 02:29:55,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:29:55,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:55,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 02:29:55,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 02:29:55,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:55,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:55,478 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 02:29:55,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:55,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474791687] [2025-03-04 02:29:55,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474791687] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:55,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107043012] [2025-03-04 02:29:55,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:29:55,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:55,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:55,480 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:29:55,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 02:29:55,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 02:29:55,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 02:29:55,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:55,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:55,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:29:55,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:55,666 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 02:29:55,666 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:55,735 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 02:29:55,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107043012] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:55,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:55,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 6] total 9 [2025-03-04 02:29:55,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915776653] [2025-03-04 02:29:55,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:55,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:29:55,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:55,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:29:55,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:29:55,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 365 [2025-03-04 02:29:55,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 254 transitions, 559 flow. Second operand has 9 states, 9 states have (on average 118.44444444444444) internal successors, (1066), 9 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:55,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:55,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 365 [2025-03-04 02:29:55,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:56,390 INFO L124 PetriNetUnfolderBase]: 951/2565 cut-off events. [2025-03-04 02:29:56,391 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-04 02:29:56,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4367 conditions, 2565 events. 951/2565 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 16258 event pairs, 696 based on Foata normal form. 2/2166 useless extension candidates. Maximal degree in co-relation 4320. Up to 1723 conditions per place. [2025-03-04 02:29:56,403 INFO L140 encePairwiseOnDemand]: 361/365 looper letters, 165 selfloop transitions, 5 changer transitions 0/276 dead transitions. [2025-03-04 02:29:56,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 276 transitions, 967 flow [2025-03-04 02:29:56,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:29:56,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:29:56,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 739 transitions. [2025-03-04 02:29:56,405 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40493150684931506 [2025-03-04 02:29:56,405 INFO L175 Difference]: Start difference. First operand has 232 places, 254 transitions, 559 flow. Second operand 5 states and 739 transitions. [2025-03-04 02:29:56,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 276 transitions, 967 flow [2025-03-04 02:29:56,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 276 transitions, 941 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 02:29:56,410 INFO L231 Difference]: Finished difference. Result has 236 places, 257 transitions, 585 flow [2025-03-04 02:29:56,411 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=585, PETRI_PLACES=236, PETRI_TRANSITIONS=257} [2025-03-04 02:29:56,412 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, 8 predicate places. [2025-03-04 02:29:56,412 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 257 transitions, 585 flow [2025-03-04 02:29:56,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 118.44444444444444) internal successors, (1066), 9 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:56,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:56,413 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:56,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 02:29:56,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:56,613 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-04 02:29:56,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:56,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1474815827, now seen corresponding path program 2 times [2025-03-04 02:29:56,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:56,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923381512] [2025-03-04 02:29:56,614 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:29:56,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:56,656 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 2 equivalence classes. [2025-03-04 02:29:56,708 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:29:56,708 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:29:56,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:57,116 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 02:29:57,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:57,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923381512] [2025-03-04 02:29:57,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923381512] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:57,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578650446] [2025-03-04 02:29:57,116 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:29:57,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:57,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:57,119 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:29:57,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 02:29:57,243 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 2 equivalence classes. [2025-03-04 02:29:57,349 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:29:57,349 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:29:57,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:57,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 02:29:57,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:57,406 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 02:29:57,408 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:57,546 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 02:29:57,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578650446] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:57,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:57,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-03-04 02:29:57,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427732663] [2025-03-04 02:29:57,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:57,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 02:29:57,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:57,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 02:29:57,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-03-04 02:29:57,656 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 365 [2025-03-04 02:29:57,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 257 transitions, 585 flow. Second operand has 15 states, 15 states have (on average 113.53333333333333) internal successors, (1703), 15 states have internal predecessors, (1703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:57,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:57,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 365 [2025-03-04 02:29:57,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:58,969 INFO L124 PetriNetUnfolderBase]: 953/2601 cut-off events. [2025-03-04 02:29:58,969 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-04 02:29:58,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4444 conditions, 2601 events. 953/2601 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 16406 event pairs, 696 based on Foata normal form. 2/2194 useless extension candidates. Maximal degree in co-relation 4395. Up to 1723 conditions per place. [2025-03-04 02:29:58,977 INFO L140 encePairwiseOnDemand]: 354/365 looper letters, 173 selfloop transitions, 27 changer transitions 0/304 dead transitions. [2025-03-04 02:29:58,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 304 transitions, 1101 flow [2025-03-04 02:29:58,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 02:29:58,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 02:29:58,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2180 transitions. [2025-03-04 02:29:58,982 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3318112633181126 [2025-03-04 02:29:58,982 INFO L175 Difference]: Start difference. First operand has 236 places, 257 transitions, 585 flow. Second operand 18 states and 2180 transitions. [2025-03-04 02:29:58,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 304 transitions, 1101 flow [2025-03-04 02:29:58,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 304 transitions, 1101 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:29:58,986 INFO L231 Difference]: Finished difference. Result has 263 places, 281 transitions, 774 flow [2025-03-04 02:29:58,987 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=774, PETRI_PLACES=263, PETRI_TRANSITIONS=281} [2025-03-04 02:29:58,987 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, 35 predicate places. [2025-03-04 02:29:58,987 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 281 transitions, 774 flow [2025-03-04 02:29:58,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 113.53333333333333) internal successors, (1703), 15 states have internal predecessors, (1703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:58,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:58,988 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:58,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 02:29:59,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:59,189 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-04 02:29:59,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:59,190 INFO L85 PathProgramCache]: Analyzing trace with hash -310188377, now seen corresponding path program 1 times [2025-03-04 02:29:59,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:59,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32634116] [2025-03-04 02:29:59,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:29:59,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:59,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 02:29:59,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 02:29:59,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:59,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:59,385 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 02:29:59,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:59,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32634116] [2025-03-04 02:29:59,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32634116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:29:59,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:29:59,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:29:59,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771139313] [2025-03-04 02:29:59,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:29:59,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:29:59,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:59,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:29:59,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:29:59,389 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 365 [2025-03-04 02:29:59,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 281 transitions, 774 flow. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:59,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:59,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 365 [2025-03-04 02:29:59,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:59,726 INFO L124 PetriNetUnfolderBase]: 945/2573 cut-off events. [2025-03-04 02:29:59,726 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-03-04 02:29:59,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4461 conditions, 2573 events. 945/2573 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 16323 event pairs, 696 based on Foata normal form. 4/2176 useless extension candidates. Maximal degree in co-relation 4401. Up to 1757 conditions per place. [2025-03-04 02:29:59,770 INFO L140 encePairwiseOnDemand]: 362/365 looper letters, 162 selfloop transitions, 6 changer transitions 0/271 dead transitions. [2025-03-04 02:29:59,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 271 transitions, 1066 flow [2025-03-04 02:29:59,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:29:59,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:29:59,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2025-03-04 02:29:59,773 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4383561643835616 [2025-03-04 02:29:59,773 INFO L175 Difference]: Start difference. First operand has 263 places, 281 transitions, 774 flow. Second operand 3 states and 480 transitions. [2025-03-04 02:29:59,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 271 transitions, 1066 flow [2025-03-04 02:29:59,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 271 transitions, 1047 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-04 02:29:59,779 INFO L231 Difference]: Finished difference. Result has 257 places, 271 transitions, 723 flow [2025-03-04 02:29:59,779 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=723, PETRI_PLACES=257, PETRI_TRANSITIONS=271} [2025-03-04 02:29:59,780 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, 29 predicate places. [2025-03-04 02:29:59,780 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 271 transitions, 723 flow [2025-03-04 02:29:59,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:59,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:59,781 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:59,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 02:29:59,781 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-04 02:29:59,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:59,782 INFO L85 PathProgramCache]: Analyzing trace with hash 722502359, now seen corresponding path program 1 times [2025-03-04 02:29:59,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:59,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898423971] [2025-03-04 02:29:59,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:29:59,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:59,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 02:29:59,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 02:29:59,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:59,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:29:59,902 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 02:29:59,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 02:29:59,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 02:29:59,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:59,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:30:00,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 02:30:00,027 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 02:30:00,028 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 29 remaining) [2025-03-04 02:30:00,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (27 of 29 remaining) [2025-03-04 02:30:00,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (26 of 29 remaining) [2025-03-04 02:30:00,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (25 of 29 remaining) [2025-03-04 02:30:00,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (24 of 29 remaining) [2025-03-04 02:30:00,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (23 of 29 remaining) [2025-03-04 02:30:00,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (22 of 29 remaining) [2025-03-04 02:30:00,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONERROR_FUNCTION (21 of 29 remaining) [2025-03-04 02:30:00,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONERROR_FUNCTION (20 of 29 remaining) [2025-03-04 02:30:00,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONERROR_FUNCTION (19 of 29 remaining) [2025-03-04 02:30:00,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONERROR_FUNCTION (18 of 29 remaining) [2025-03-04 02:30:00,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONERROR_FUNCTION (17 of 29 remaining) [2025-03-04 02:30:00,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONERROR_FUNCTION (16 of 29 remaining) [2025-03-04 02:30:00,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONERROR_FUNCTION (15 of 29 remaining) [2025-03-04 02:30:00,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 29 remaining) [2025-03-04 02:30:00,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 29 remaining) [2025-03-04 02:30:00,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONERROR_FUNCTION (12 of 29 remaining) [2025-03-04 02:30:00,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONERROR_FUNCTION (11 of 29 remaining) [2025-03-04 02:30:00,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONERROR_FUNCTION (10 of 29 remaining) [2025-03-04 02:30:00,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONERROR_FUNCTION (9 of 29 remaining) [2025-03-04 02:30:00,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONERROR_FUNCTION (8 of 29 remaining) [2025-03-04 02:30:00,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONERROR_FUNCTION (7 of 29 remaining) [2025-03-04 02:30:00,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONERROR_FUNCTION (6 of 29 remaining) [2025-03-04 02:30:00,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONERROR_FUNCTION (5 of 29 remaining) [2025-03-04 02:30:00,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONERROR_FUNCTION (4 of 29 remaining) [2025-03-04 02:30:00,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 29 remaining) [2025-03-04 02:30:00,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 29 remaining) [2025-03-04 02:30:00,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 29 remaining) [2025-03-04 02:30:00,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 29 remaining) [2025-03-04 02:30:00,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 02:30:00,032 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:00,037 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 02:30:00,037 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 02:30:00,163 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 02:30:00,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 395 places, 636 transitions, 1288 flow [2025-03-04 02:30:00,226 INFO L124 PetriNetUnfolderBase]: 275/714 cut-off events. [2025-03-04 02:30:00,227 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 02:30:00,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 714 events. 275/714 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2839 event pairs, 0 based on Foata normal form. 0/401 useless extension candidates. Maximal degree in co-relation 587. Up to 12 conditions per place. [2025-03-04 02:30:00,239 INFO L82 GeneralOperation]: Start removeDead. Operand has 395 places, 636 transitions, 1288 flow [2025-03-04 02:30:00,250 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 395 places, 636 transitions, 1288 flow [2025-03-04 02:30:00,251 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:30:00,251 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;@551d6f11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:30:00,251 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2025-03-04 02:30:00,255 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:30:00,255 INFO L124 PetriNetUnfolderBase]: 9/25 cut-off events. [2025-03-04 02:30:00,255 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:30:00,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:00,255 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:00,256 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2025-03-04 02:30:00,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:00,256 INFO L85 PathProgramCache]: Analyzing trace with hash -32612852, now seen corresponding path program 1 times [2025-03-04 02:30:00,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:00,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990527311] [2025-03-04 02:30:00,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:00,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:00,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 02:30:00,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 02:30:00,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:00,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:00,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:00,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:00,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990527311] [2025-03-04 02:30:00,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990527311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:30:00,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:30:00,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:30:00,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302967367] [2025-03-04 02:30:00,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:30:00,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:30:00,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:00,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:30:00,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:30:00,300 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 636 [2025-03-04 02:30:00,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 636 transitions, 1288 flow. Second operand has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:30:00,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:00,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 636 [2025-03-04 02:30:00,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:20,443 INFO L124 PetriNetUnfolderBase]: 174371/294669 cut-off events. [2025-03-04 02:30:20,443 INFO L125 PetriNetUnfolderBase]: For 772/772 co-relation queries the response was YES. [2025-03-04 02:30:20,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 538022 conditions, 294669 events. 174371/294669 cut-off events. For 772/772 co-relation queries the response was YES. Maximal size of possible extension queue 4071. Compared 2878920 event pairs, 132336 based on Foata normal form. 140795/392431 useless extension candidates. Maximal degree in co-relation 515450. Up to 242895 conditions per place. [2025-03-04 02:30:21,795 INFO L140 encePairwiseOnDemand]: 448/636 looper letters, 253 selfloop transitions, 3 changer transitions 0/449 dead transitions. [2025-03-04 02:30:21,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 449 transitions, 1426 flow [2025-03-04 02:30:21,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:30:21,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:30:21,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1217 transitions. [2025-03-04 02:30:21,798 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4783805031446541 [2025-03-04 02:30:21,798 INFO L175 Difference]: Start difference. First operand has 395 places, 636 transitions, 1288 flow. Second operand 4 states and 1217 transitions. [2025-03-04 02:30:21,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 449 transitions, 1426 flow [2025-03-04 02:30:21,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 449 transitions, 1426 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:30:21,804 INFO L231 Difference]: Finished difference. Result has 396 places, 449 transitions, 920 flow [2025-03-04 02:30:21,804 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=914, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=920, PETRI_PLACES=396, PETRI_TRANSITIONS=449} [2025-03-04 02:30:21,805 INFO L279 CegarLoopForPetriNet]: 395 programPoint places, 1 predicate places. [2025-03-04 02:30:21,805 INFO L471 AbstractCegarLoop]: Abstraction has has 396 places, 449 transitions, 920 flow [2025-03-04 02:30:21,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:30:21,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:21,805 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:21,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 02:30:21,806 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2025-03-04 02:30:21,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:21,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1276057813, now seen corresponding path program 1 times [2025-03-04 02:30:21,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:21,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980259197] [2025-03-04 02:30:21,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:21,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:21,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 02:30:21,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 02:30:21,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:21,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:21,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:21,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:21,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980259197] [2025-03-04 02:30:21,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980259197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:30:21,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:30:21,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:30:21,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971923732] [2025-03-04 02:30:21,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:30:21,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:30:21,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:21,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:30:21,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:30:21,849 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 636 [2025-03-04 02:30:21,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 449 transitions, 920 flow. Second operand has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:30:21,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:21,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 636 [2025-03-04 02:30:21,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand