./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/libvsync/ttaslock.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/ttaslock.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 1232142cbd2d3669d71853399351b59e265805f095536d7cdae31e54b7810261 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:30:23,101 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:30:23,161 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:30:23,168 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:30:23,169 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:30:23,187 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:30:23,189 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:30:23,189 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:30:23,189 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:30:23,190 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:30:23,190 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:30:23,190 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:30:23,191 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:30:23,191 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:30:23,191 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:30:23,191 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:30:23,192 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:30:23,192 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:30:23,192 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:30:23,192 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:30:23,192 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:30:23,192 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:30:23,192 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:30:23,192 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:30:23,192 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:30:23,192 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:30:23,192 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:30:23,192 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:30:23,193 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:30:23,193 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:30:23,193 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:30:23,193 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:30:23,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:30:23,193 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:30:23,193 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:30:23,193 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:30:23,194 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:30:23,194 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:30:23,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:30:23,194 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:30:23,194 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:30:23,194 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:30:23,194 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:30:23,194 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 -> 1232142cbd2d3669d71853399351b59e265805f095536d7cdae31e54b7810261 [2025-03-04 02:30:23,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:30:23,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:30:23,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:30:23,448 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:30:23,448 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:30:23,450 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/ttaslock.i [2025-03-04 02:30:24,677 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edaac75d6/32685b037b9441b699b5727f31bb9d65/FLAGd2844a2c0 [2025-03-04 02:30:25,094 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:30:25,095 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/ttaslock.i [2025-03-04 02:30:25,138 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edaac75d6/32685b037b9441b699b5727f31bb9d65/FLAGd2844a2c0 [2025-03-04 02:30:25,242 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edaac75d6/32685b037b9441b699b5727f31bb9d65 [2025-03-04 02:30:25,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:30:25,244 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:30:25,245 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:30:25,245 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:30:25,248 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:30:25,249 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:30:25" (1/1) ... [2025-03-04 02:30:25,249 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46248927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:25, skipping insertion in model container [2025-03-04 02:30:25,249 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:30:25" (1/1) ... [2025-03-04 02:30:25,317 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:30:27,395 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/ttaslock.i[193996,194009] [2025-03-04 02:30:27,397 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/ttaslock.i[194063,194076] [2025-03-04 02:30:27,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:30:27,415 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:30:27,492 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] [2025-03-04 02:30:27,493 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] [2025-03-04 02:30:27,494 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] [2025-03-04 02:30:27,496 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] [2025-03-04 02:30:27,496 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] [2025-03-04 02:30:27,497 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] [2025-03-04 02:30:27,498 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] [2025-03-04 02:30:27,498 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] [2025-03-04 02:30:27,498 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] [2025-03-04 02:30:27,499 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] [2025-03-04 02:30:27,499 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] [2025-03-04 02:30:27,500 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] [2025-03-04 02:30:27,500 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] [2025-03-04 02:30:27,500 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] [2025-03-04 02:30:27,501 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] [2025-03-04 02:30:27,502 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] [2025-03-04 02:30:27,502 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] [2025-03-04 02:30:27,502 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] [2025-03-04 02:30:27,502 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] [2025-03-04 02:30:27,502 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] [2025-03-04 02:30:27,502 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] [2025-03-04 02:30:27,503 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] [2025-03-04 02:30:27,503 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] [2025-03-04 02:30:27,503 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] [2025-03-04 02:30:27,503 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] [2025-03-04 02:30:27,503 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] [2025-03-04 02:30:27,503 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] [2025-03-04 02:30:27,504 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] [2025-03-04 02:30:27,504 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] [2025-03-04 02:30:27,504 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] [2025-03-04 02:30:27,504 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] [2025-03-04 02:30:27,504 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] [2025-03-04 02:30:27,504 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] [2025-03-04 02:30:27,505 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] [2025-03-04 02:30:27,505 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] [2025-03-04 02:30:27,505 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] [2025-03-04 02:30:27,505 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] [2025-03-04 02:30:27,508 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] [2025-03-04 02:30:27,508 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] [2025-03-04 02:30:27,509 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] [2025-03-04 02:30:27,510 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] [2025-03-04 02:30:27,511 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] [2025-03-04 02:30:27,511 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] [2025-03-04 02:30:27,511 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] [2025-03-04 02:30:27,512 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] [2025-03-04 02:30:27,512 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] [2025-03-04 02:30:27,513 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] [2025-03-04 02:30:27,514 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] [2025-03-04 02:30:27,515 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] [2025-03-04 02:30:27,515 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] [2025-03-04 02:30:27,516 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] [2025-03-04 02:30:27,516 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] [2025-03-04 02:30:27,516 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] [2025-03-04 02:30:27,517 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] [2025-03-04 02:30:27,518 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] [2025-03-04 02:30:27,518 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] [2025-03-04 02:30:27,519 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] [2025-03-04 02:30:27,519 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] [2025-03-04 02:30:27,520 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] [2025-03-04 02:30:27,520 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] [2025-03-04 02:30:27,520 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] [2025-03-04 02:30:27,521 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] [2025-03-04 02:30:27,522 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] [2025-03-04 02:30:27,522 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] [2025-03-04 02:30:27,522 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] [2025-03-04 02:30:27,522 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] [2025-03-04 02:30:27,523 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] [2025-03-04 02:30:27,524 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] [2025-03-04 02:30:27,524 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] [2025-03-04 02:30:27,524 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] [2025-03-04 02:30:27,525 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] [2025-03-04 02:30:27,526 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] [2025-03-04 02:30:27,526 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] [2025-03-04 02:30:27,526 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] [2025-03-04 02:30:27,526 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] [2025-03-04 02:30:27,527 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] [2025-03-04 02:30:27,528 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] [2025-03-04 02:30:27,529 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] [2025-03-04 02:30:27,529 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] [2025-03-04 02:30:27,530 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] [2025-03-04 02:30:27,530 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] [2025-03-04 02:30:27,530 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] [2025-03-04 02:30:27,531 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] [2025-03-04 02:30:27,532 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] [2025-03-04 02:30:27,532 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] [2025-03-04 02:30:27,532 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] [2025-03-04 02:30:27,533 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] [2025-03-04 02:30:27,533 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] [2025-03-04 02:30:27,533 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] [2025-03-04 02:30:27,533 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] [2025-03-04 02:30:27,533 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] [2025-03-04 02:30:27,533 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] [2025-03-04 02:30:27,534 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] [2025-03-04 02:30:27,534 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] [2025-03-04 02:30:27,534 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] [2025-03-04 02:30:27,534 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] [2025-03-04 02:30:27,534 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] [2025-03-04 02:30:27,534 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] [2025-03-04 02:30:27,535 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] [2025-03-04 02:30:27,535 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] [2025-03-04 02:30:27,588 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/ttaslock.i[193996,194009] [2025-03-04 02:30:27,589 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/ttaslock.i[194063,194076] [2025-03-04 02:30:27,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:30:27,839 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:30:27,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:27 WrapperNode [2025-03-04 02:30:27,840 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:30:27,840 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:30:27,840 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:30:27,840 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:30:27,846 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:30:27" (1/1) ... [2025-03-04 02:30:27,914 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:30:27" (1/1) ... [2025-03-04 02:30:27,938 INFO L138 Inliner]: procedures = 917, calls = 911, calls flagged for inlining = 813, calls inlined = 27, statements flattened = 257 [2025-03-04 02:30:27,938 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:30:27,939 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:30:27,939 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:30:27,939 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:30:27,949 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:27" (1/1) ... [2025-03-04 02:30:27,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:27" (1/1) ... [2025-03-04 02:30:27,951 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:27" (1/1) ... [2025-03-04 02:30:27,963 INFO L175 MemorySlicer]: Split 9 memory accesses to 3 slices as follows [2, 5, 2]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 3 writes are split as follows [0, 2, 1]. [2025-03-04 02:30:27,963 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:27" (1/1) ... [2025-03-04 02:30:27,963 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:27" (1/1) ... [2025-03-04 02:30:27,968 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:27" (1/1) ... [2025-03-04 02:30:27,969 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:27" (1/1) ... [2025-03-04 02:30:27,970 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:27" (1/1) ... [2025-03-04 02:30:27,971 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:27" (1/1) ... [2025-03-04 02:30:27,973 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:30:27,973 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:30:27,973 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:30:27,973 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:30:27,974 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:27" (1/1) ... [2025-03-04 02:30:27,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:30:27,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:30:28,003 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:30:28,005 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:30:28,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:30:28,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:30:28,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 02:30:28,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:30:28,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:30:28,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:30:28,023 INFO L130 BoogieDeclarations]: Found specification of procedure run [2025-03-04 02:30:28,023 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2025-03-04 02:30:28,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 02:30:28,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:30:28,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:30:28,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 02:30:28,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 02:30:28,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:30:28,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:30:28,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 02:30:28,024 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:30:28,143 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:30:28,144 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:30:28,416 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2255: havoc vatomic32_await_eq_rlx_#t~ret168#1; [2025-03-04 02:30:28,417 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1910: havoc vatomic32_xchg_acq_#t~ret115#1; [2025-03-04 02:30:28,491 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6001: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-03-04 02:30:28,492 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6001-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-03-04 02:30:28,493 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:30:28,493 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:30:28,664 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:30:28,664 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:30:28,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:30:28 BoogieIcfgContainer [2025-03-04 02:30:28,665 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:30:28,666 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:30:28,667 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:30:28,671 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:30:28,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:30:25" (1/3) ... [2025-03-04 02:30:28,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@769b44be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:30:28, skipping insertion in model container [2025-03-04 02:30:28,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:27" (2/3) ... [2025-03-04 02:30:28,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@769b44be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:30:28, skipping insertion in model container [2025-03-04 02:30:28,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:30:28" (3/3) ... [2025-03-04 02:30:28,672 INFO L128 eAbstractionObserver]: Analyzing ICFG ttaslock.i [2025-03-04 02:30:28,684 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:30:28,685 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ttaslock.i that has 2 procedures, 72 locations, 1 initial locations, 19 loop locations, and 2 error locations. [2025-03-04 02:30:28,686 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:30:28,771 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 02:30:28,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 133 transitions, 273 flow [2025-03-04 02:30:28,869 INFO L124 PetriNetUnfolderBase]: 72/161 cut-off events. [2025-03-04 02:30:28,874 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 02:30:28,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 161 events. 72/161 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 380 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 119. Up to 8 conditions per place. [2025-03-04 02:30:28,880 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 133 transitions, 273 flow [2025-03-04 02:30:28,888 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 133 transitions, 273 flow [2025-03-04 02:30:28,897 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:30:28,909 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;@2a734c5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:30:28,909 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-04 02:30:28,921 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:30:28,921 INFO L124 PetriNetUnfolderBase]: 23/51 cut-off events. [2025-03-04 02:30:28,921 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:30:28,921 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:28,921 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:28,922 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:30:28,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:28,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1081451672, now seen corresponding path program 1 times [2025-03-04 02:30:28,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:28,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056265325] [2025-03-04 02:30:28,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:28,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:29,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 02:30:29,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 02:30:29,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:29,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:29,071 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:29,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:29,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056265325] [2025-03-04 02:30:29,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056265325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:30:29,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:30:29,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:30:29,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684724597] [2025-03-04 02:30:29,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:30:29,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 02:30:29,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:29,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 02:30:29,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:30:29,105 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 133 [2025-03-04 02:30:29,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 133 transitions, 273 flow. Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 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:29,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:29,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 133 [2025-03-04 02:30:29,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:29,376 INFO L124 PetriNetUnfolderBase]: 311/789 cut-off events. [2025-03-04 02:30:29,376 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 02:30:29,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1414 conditions, 789 events. 311/789 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4107 event pairs, 256 based on Foata normal form. 392/1043 useless extension candidates. Maximal degree in co-relation 1368. Up to 620 conditions per place. [2025-03-04 02:30:29,383 INFO L140 encePairwiseOnDemand]: 79/133 looper letters, 51 selfloop transitions, 0 changer transitions 1/79 dead transitions. [2025-03-04 02:30:29,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 79 transitions, 269 flow [2025-03-04 02:30:29,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 02:30:29,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 02:30:29,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 160 transitions. [2025-03-04 02:30:29,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6015037593984962 [2025-03-04 02:30:29,398 INFO L175 Difference]: Start difference. First operand has 75 places, 133 transitions, 273 flow. Second operand 2 states and 160 transitions. [2025-03-04 02:30:29,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 79 transitions, 269 flow [2025-03-04 02:30:29,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 79 transitions, 269 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:30:29,411 INFO L231 Difference]: Finished difference. Result has 76 places, 78 transitions, 163 flow [2025-03-04 02:30:29,413 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=163, PETRI_PLACES=76, PETRI_TRANSITIONS=78} [2025-03-04 02:30:29,417 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 1 predicate places. [2025-03-04 02:30:29,417 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 78 transitions, 163 flow [2025-03-04 02:30:29,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 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:29,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:29,418 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:29,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:30:29,418 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:30:29,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:29,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1953227568, now seen corresponding path program 1 times [2025-03-04 02:30:29,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:29,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356614915] [2025-03-04 02:30:29,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:29,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:29,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 02:30:29,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 02:30:29,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:29,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:30:29,456 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 02:30:29,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 02:30:29,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 02:30:29,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:29,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:30:29,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 02:30:29,508 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 02:30:29,510 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-03-04 02:30:29,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-03-04 02:30:29,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-03-04 02:30:29,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:30:29,512 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 02:30:29,515 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 02:30:29,515 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 02:30:29,600 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 02:30:29,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 225 transitions, 466 flow [2025-03-04 02:30:29,645 INFO L124 PetriNetUnfolderBase]: 135/303 cut-off events. [2025-03-04 02:30:29,646 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 02:30:29,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315 conditions, 303 events. 135/303 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 991 event pairs, 0 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 229. Up to 12 conditions per place. [2025-03-04 02:30:29,653 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 225 transitions, 466 flow [2025-03-04 02:30:29,661 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 225 transitions, 466 flow [2025-03-04 02:30:29,663 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:30:29,663 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;@2a734c5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:30:29,663 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-04 02:30:29,670 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:30:29,670 INFO L124 PetriNetUnfolderBase]: 23/52 cut-off events. [2025-03-04 02:30:29,671 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 02:30:29,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:29,671 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:29,671 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:30:29,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:29,673 INFO L85 PathProgramCache]: Analyzing trace with hash -787607789, now seen corresponding path program 1 times [2025-03-04 02:30:29,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:29,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222700132] [2025-03-04 02:30:29,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:29,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:29,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 02:30:29,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 02:30:29,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:29,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:29,727 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:29,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:29,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222700132] [2025-03-04 02:30:29,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222700132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:30:29,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:30:29,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:30:29,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545649689] [2025-03-04 02:30:29,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:30:29,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 02:30:29,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:29,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 02:30:29,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:30:29,728 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 225 [2025-03-04 02:30:29,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 225 transitions, 466 flow. Second operand has 2 states, 2 states have (on average 44.5) internal successors, (89), 2 states have internal predecessors, (89), 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:29,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:29,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 225 [2025-03-04 02:30:29,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:32,462 INFO L124 PetriNetUnfolderBase]: 22089/36378 cut-off events. [2025-03-04 02:30:32,467 INFO L125 PetriNetUnfolderBase]: For 277/277 co-relation queries the response was YES. [2025-03-04 02:30:32,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68947 conditions, 36378 events. 22089/36378 cut-off events. For 277/277 co-relation queries the response was YES. Maximal size of possible extension queue 877. Compared 278681 event pairs, 18400 based on Foata normal form. 17571/47635 useless extension candidates. Maximal degree in co-relation 61291. Up to 32397 conditions per place. [2025-03-04 02:30:32,663 INFO L140 encePairwiseOnDemand]: 133/225 looper letters, 91 selfloop transitions, 0 changer transitions 1/133 dead transitions. [2025-03-04 02:30:32,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 133 transitions, 466 flow [2025-03-04 02:30:32,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 02:30:32,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 02:30:32,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 266 transitions. [2025-03-04 02:30:32,666 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5911111111111111 [2025-03-04 02:30:32,666 INFO L175 Difference]: Start difference. First operand has 124 places, 225 transitions, 466 flow. Second operand 2 states and 266 transitions. [2025-03-04 02:30:32,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 133 transitions, 466 flow [2025-03-04 02:30:32,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 133 transitions, 466 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:30:32,669 INFO L231 Difference]: Finished difference. Result has 125 places, 132 transitions, 280 flow [2025-03-04 02:30:32,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=280, PETRI_PLACES=125, PETRI_TRANSITIONS=132} [2025-03-04 02:30:32,670 INFO L279 CegarLoopForPetriNet]: 124 programPoint places, 1 predicate places. [2025-03-04 02:30:32,670 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 132 transitions, 280 flow [2025-03-04 02:30:32,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 44.5) internal successors, (89), 2 states have internal predecessors, (89), 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:32,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:32,670 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:32,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:30:32,670 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:30:32,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:32,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1470378268, now seen corresponding path program 1 times [2025-03-04 02:30:32,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:32,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080101170] [2025-03-04 02:30:32,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:32,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:32,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 02:30:32,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 02:30:32,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:32,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:32,790 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:32,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:32,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080101170] [2025-03-04 02:30:32,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080101170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:30:32,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:30:32,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:30:32,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549920126] [2025-03-04 02:30:32,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:30:32,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:30:32,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:32,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:30:32,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:30:32,792 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 225 [2025-03-04 02:30:32,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 132 transitions, 280 flow. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:30:32,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:32,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 225 [2025-03-04 02:30:32,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:34,936 INFO L124 PetriNetUnfolderBase]: 19504/33945 cut-off events. [2025-03-04 02:30:34,936 INFO L125 PetriNetUnfolderBase]: For 225/225 co-relation queries the response was YES. [2025-03-04 02:30:34,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62772 conditions, 33945 events. 19504/33945 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 714. Compared 271475 event pairs, 7520 based on Foata normal form. 0/27955 useless extension candidates. Maximal degree in co-relation 62767. Up to 28613 conditions per place. [2025-03-04 02:30:35,069 INFO L140 encePairwiseOnDemand]: 222/225 looper letters, 129 selfloop transitions, 2 changer transitions 0/172 dead transitions. [2025-03-04 02:30:35,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 172 transitions, 622 flow [2025-03-04 02:30:35,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:30:35,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:30:35,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 255 transitions. [2025-03-04 02:30:35,071 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37777777777777777 [2025-03-04 02:30:35,071 INFO L175 Difference]: Start difference. First operand has 125 places, 132 transitions, 280 flow. Second operand 3 states and 255 transitions. [2025-03-04 02:30:35,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 172 transitions, 622 flow [2025-03-04 02:30:35,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 172 transitions, 622 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:30:35,077 INFO L231 Difference]: Finished difference. Result has 127 places, 133 transitions, 292 flow [2025-03-04 02:30:35,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=292, PETRI_PLACES=127, PETRI_TRANSITIONS=133} [2025-03-04 02:30:35,080 INFO L279 CegarLoopForPetriNet]: 124 programPoint places, 3 predicate places. [2025-03-04 02:30:35,080 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 133 transitions, 292 flow [2025-03-04 02:30:35,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:30:35,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:35,081 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:35,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:30:35,081 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:30:35,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:35,081 INFO L85 PathProgramCache]: Analyzing trace with hash 539533649, now seen corresponding path program 1 times [2025-03-04 02:30:35,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:35,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040223553] [2025-03-04 02:30:35,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:35,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:35,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 02:30:35,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 02:30:35,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:35,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:30:35,119 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 02:30:35,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 02:30:35,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 02:30:35,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:35,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:30:35,141 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 02:30:35,141 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 02:30:35,142 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-03-04 02:30:35,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-03-04 02:30:35,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-03-04 02:30:35,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:30:35,142 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-04 02:30:35,143 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 02:30:35,144 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 02:30:35,215 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 02:30:35,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 317 transitions, 661 flow [2025-03-04 02:30:35,247 INFO L124 PetriNetUnfolderBase]: 213/486 cut-off events. [2025-03-04 02:30:35,247 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-04 02:30:35,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 486 events. 213/486 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1838 event pairs, 1 based on Foata normal form. 0/253 useless extension candidates. Maximal degree in co-relation 361. Up to 24 conditions per place. [2025-03-04 02:30:35,253 INFO L82 GeneralOperation]: Start removeDead. Operand has 173 places, 317 transitions, 661 flow [2025-03-04 02:30:35,260 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 173 places, 317 transitions, 661 flow [2025-03-04 02:30:35,261 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:30:35,261 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;@2a734c5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:30:35,261 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-04 02:30:35,263 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:30:35,263 INFO L124 PetriNetUnfolderBase]: 23/52 cut-off events. [2025-03-04 02:30:35,264 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 02:30:35,264 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:35,264 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:35,264 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:30:35,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:35,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1146113584, now seen corresponding path program 1 times [2025-03-04 02:30:35,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:35,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386016003] [2025-03-04 02:30:35,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:35,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:35,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 02:30:35,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 02:30:35,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:35,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:35,399 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:35,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:35,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386016003] [2025-03-04 02:30:35,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386016003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:30:35,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:30:35,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:30:35,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029024326] [2025-03-04 02:30:35,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:30:35,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 02:30:35,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:35,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 02:30:35,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:30:35,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 317 [2025-03-04 02:30:35,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 317 transitions, 661 flow. Second operand has 2 states, 2 states have (on average 58.5) internal successors, (117), 2 states have internal predecessors, (117), 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:35,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:35,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 317 [2025-03-04 02:30:35,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand